Leetcode - 230. Kth Smallest Element in a BST (BST)

最新推荐文章于 2024-06-07 05:21:43 发布

BUPT-WT

最新推荐文章于 2024-06-07 05:21:43 发布

阅读量113

点赞数

分类专栏：秋招

本文链接：https://blog.csdn.net/weixin_41362649/article/details/100003826

版权

秋招专栏收录该内容

179 篇文章 2 订阅

订阅专栏

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):

    if not root:
        return None
    
    stack = []

    while stack or root:
        while root:
            stack.append(root)
            root = root.left

        root = stack.pop()

        k -= 1
        if k == 0:
            return root.val
        
        root = root.right