【题目】
给定一个二叉搜索树的根节点 root ,和一个整数 k ,请你设计一个算法查找其中第 k 个最小元素(从 1 开始计数)。
示例 1:
输入:root = [3,1,4,null,2], k = 1
输出:1
示例 2:
输入:root = [5,3,6,2,4,null,null,1], k = 3
输出:3
提示:
树中的节点数为 n 。
1 <= k <= n <= 104
0 <= Node.val <= 104
进阶:如果二叉搜索树经常被修改(插入/删除操作)并且你需要频繁地查找第 k 小的值,你将如何优化算法?
【代码】
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, val=0, left=None, right=None):
# self.val = val
# self.left = left
# self.right = right
class Solution:
def dfs(self,root):
if not root:
return
self.dfs(root.left)
if self.k:
self.ans=root.val
self.k-=1
self.dfs(root.right)
def kthSmallest(self, root: TreeNode, k: int) -> int:
self.ans=0
self.k=k
self.dfs(root)
return self.ans
【方法2:递归】
class Solution:
def kthSmallest(self, root: TreeNode, k: int) -> int:
def inOrder(root):
return inOrder(root.left)+[root.val]+inOrder(root.right) if root else []
return inOrder(root)[k-1]
【方法3】
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, val=0, left=None, right=None):
# self.val = val
# self.left = left
# self.right = right
class Solution:
def kthSmallest(self, root: TreeNode, k: int) -> int:
stack=[]
while stack or root:
while root:
stack.append(root)
root=root.left
root=stack.pop()
if k:
k-=1
if not k:
return root.val
root=root.right
return 0
【方法4:yield】
class Solution:
def kthSmallest(self, root, k):
"""
:type root: TreeNode
:type k: int
:rtype: int
"""
def gen(r):
if r is not None:
yield from gen(r.left)
yield r.val
yield from gen(r.right)
it = gen(root)
for _ in range(k):
ans = next(it)
return ans