题目描述
给定一棵二叉搜索树,请找出其中的第k小的结点。例如, (5,3,7,2,4,6,8) 中,按结点数值大小顺序第三小结点的值为4。
Solution
class Solution:
# 返回对应节点TreeNode
def KthNode(self, pRoot, k):
node = pRoot
stack = []
count = 0
while len(stack) != 0 or node is not None:
while node is not None:
stack.append(node)
node = node.left
node = stack.pop(-1)
count += 1
if count == k:
return node
node = node.right
二叉树非递归遍历–中序遍历
- 不需要使用头节点初始化stack
- node默认为头节点
- 停止条件为stack空并且node为空,因为此时没有任何节点可供访问。
- 注意层次遍历需要初始化stack为头节点。
class TreeNode:
def __init__(self, x):
self.val = x
self.left = None
self.right = None
class Solution:
def InOrder(self, pRoot, k):
node = pRoot
stack = []
while stack or node: # 停止条件:栈空并且当前节点为空
while node:
stack.append(node)
node = node.left
node = stack.pop()
print(node.val) # 访问该节点
node = node.right # 准备访问右节点
r = TreeNode(4)
r.left = TreeNode(2)
r.left.left = TreeNode(1)
r.left.right = TreeNode(3)
r.right = TreeNode(10)
Solution().order(r, 0)