leetcode 腾讯精选练习（50 题）230.二叉搜索树中第K小的元素

最新推荐文章于 2024-07-12 05:42:31 发布

solejay

最新推荐文章于 2024-07-12 05:42:31 发布

阅读量139

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/m0_37991005/article/details/93377979

版权

leetcode 专栏收录该内容

50 篇文章 1 订阅

订阅专栏

原题目

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?

思路

第一遍解法

网上好的解法

def kthSmallest(root, k):
    stack = []
    while root or stack:
        while root:
            stack.append(root)
            root = root.left
        root = stack.pop()
        k -= 1
        if k == 0:
            return root.val
        root = root.right