[Leetcode] 230. Kth Smallest Element in a BST

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

清凉sama

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

阅读量140

点赞数

分类专栏： leetcode 文章标签： BST 二叉树中序遍历 Leetcode

本文链接：https://blog.csdn.net/a389370297/article/details/100826168

版权

leetcode 专栏收录该内容

5 篇文章 0 订阅

订阅专栏

题目

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?

思路

又是一道二叉树的中序遍历题目

Python代码

# Definition for a binary tree node.
# class TreeNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution(object):
    def kthSmallest(self, root, k):
        """
        :type root: TreeNode
        :type k: int
        :rtype: int
        """
        p = root
        stack = []
        while p or len(stack) != 0:
            while p:
                stack.append(p)
                p = p.left
            p = stack.pop()
            k -= 1
            if k == 0:
                return p.val
            p = p.right