剑指 Offer 54. 二叉搜索树的第k大节点

class Solution {
  
    private int ans = 0, cnt = 0;
    
    private void dfs(TreeNode root , int k){
        if(root == null)
        return ;
        dfs(root.right, k);
        if(++cnt == k){
            ans = root.val;
        }
        dfs(root.left, k);
    }

    int kthLargest(TreeNode root, int k) {
        dfs(root,k);
        return ans;
    }
};