LeetCode 230.Kth Smallest Element in a BST

最新推荐文章于 2023-06-03 15:29:39 发布

ZQYnn~

最新推荐文章于 2023-06-03 15:29:39 发布

阅读量122

点赞数

分类专栏： LeetCode # LeetCode — dfs

本文链接：https://blog.csdn.net/weixin_42265429/article/details/100823796

版权

LeetCode 同时被 2 个专栏收录

35 篇文章 0 订阅

订阅专栏

LeetCode — dfs

18 篇文章 0 订阅

订阅专栏

Kth Smallest Element in a BST

Given a binary search tree, write a function kthSmallest to find the kth smallest element in it.

Note:
You may assume k is always valid, 1 ≤ k ≤ BST’s total elements.

Example 1:

Input: root = [3,1,4,null,2], k = 1
   3
  / \
 1   4
  \
   2
Output: 1

Example 2:

Input: root = [5,3,6,2,4,null,null,1], k = 3
       5
      / \
     3   6
    / \
   2   4
  /
 1
Output: 3

Follow up:
What if the BST is modified (insert/delete operations) often and you need to find the kth smallest frequently? How would you optimize the kthSmallest routine?

解题思路

此题是BST树那么通过前序遍历第K个TreeNode的值就是需要返回的值通过stack实现可以看94题的图示解析

解题代码

class Solution {
    public int kthSmallest(TreeNode root, int k) {
        Stack<TreeNode> stack = new Stack<>();
        while (root != null || !stack.empty()){
            while (root != null){
                stack.add(root);
                root = root.left;   
            }
            root = stack.pop();
            if (--k == 0) break;
            root = root.right;
        }
        return root.val;
    }
}

dfs

class Solution {
    public int kthSmallest(TreeNode root, int k) {
        List<Integer> list = new ArrayList<>();
        dfs(root, list);
        return list.get(k - 1);
    }
    public void dfs(TreeNode root, List<Integer> list){
        if (root == null) return;
        dfs(root.left, list);
        list.add(root.val);
        dfs(root.right, list);
    }
}