剑指Offer每日一题11

剑指Offer每日一题11

面试题54. 二叉搜索树的第k大节点

给定一棵二叉搜索树，请找出其中第k大的节点。

示例 1: 输入: root = [3,1,4,null,2], k = 1 输出: 4

                 3
                / \
               1   4
                \
                 2
              

示例 2: 输入: root = [5,3,6,2,4,null,null,1], k = 3 输出: 4

                5
               / \
              3   6
             / \
            2   4
          /
         1

限制：1 ≤ k ≤ 二叉搜索树元素个数

1.递归

class TreeNode {
  int val;
  TreeNode left;
  TreeNode right;
  TreeNode(int x) { val = x; }
 }
class Solution {
    private int ans = 0, count = 0;
    public int largest(TreeNode root, int k) {
        search(root, k);
        return ans;
    }    
    private void search(TreeNode root, int k) {
        if (root.right != null)search(root.right, k);
        
        if (++count == k) {
            ans = root.val;
            return;
        }        
        if (root.left != null) search(root.left, k);
    }
}

2.迭代

class Solution {
    public int kthLargest(TreeNode root, int k) {
        List<Integer> result = new LinkedList<>();
        Stack<TreeNode> stack = new Stack<>();
        TreeNode cur = root;
        while (cur != null || !stack.isEmpty()) {
            while (cur != null) {
                stack.push(cur);
                cur = cur.right;
            }
            cur = stack.pop();
            result.add(cur.val);
            cur = cur.left;
        }
        return result.get(k - 1);
    }
}