二叉搜索树的第k个结点

题目描述

给定一颗二叉搜索树，请找出其中的第k大的结点。例如， 5 / \ 3 7 /\ /\ 2 4 6 8 中，按结点数值大小顺序第三个结点的值为4。

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

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

    }

}
*/
public class Solution {
    public int targetV = 0;
    TreeNode KthNode(TreeNode pRoot, int k)
    {
        if(pRoot == null || k == 0)
            return null;
        targetV = k;
        return helper(pRoot);
        
    }
    
    TreeNode helper(TreeNode root){
        TreeNode target = null;
        //在左子树上面寻找target
        if(root.left != null){
            target = helper(root.left);
        }
        if(target == null){
            if(targetV == 1)
                target = root;
            else targetV--;
        }
        if(target == null && root.right != null){
            target = helper(root.right);
        }
        return target;
    }


}