/*
public class TreeNode {
    int val = 0;
    TreeNode left = null;
    TreeNode right = null;

    public TreeNode(int val) {
        this.val = val;

    }

}
*/
 TreeNode KthNode(TreeNode pRoot, int k)
    {
        if(pRoot==null||k<=0)
            return null;
        int i=1;
        Stack<TreeNode> stack=new Stack<TreeNode>();
        TreeNode temp=pRoot;
        while(temp!=null||!stack.isEmpty()){
            while(temp!=null){
                stack.push(temp);
                temp=temp.left;
            }
            temp=stack.pop();
            if(i++==k)
                return temp;
            temp=temp.right;
        }
        return null;
    }