题目描述
给定一棵二叉搜索树,请找出其中的第k小的结点。例如, (5,3,7,2,4,6,8) 中,按结点数值大小顺序第三小结点的值为4。
思路:
二叉搜索树,左节点<根节点<右节点,按照中序遍历正好,是从小到大排列,考察中序遍历。
# -*- coding:utf-8 -*-
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution:
# 返回对应节点TreeNode
def KthNode(self, pRoot, k):
# write code here
self.res = []
self.traversal(pRoot)
return self.res[k-1] if k>=1 and k<=len(self.res) else None #探讨k的大小
#中序遍历——递归
def traversal(self,pRoot):
if not pRoot:
return None
self.traversal(pRoot.left)
self.res.append(pRoot)
self.traversal(pRoot.right)
非递归中序遍历
# -*- coding:utf-8 -*-
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution:
# 返回对应节点TreeNode
def KthNode(self, pRoot, k):
# write code here
res = self.traversal(pRoot)
return res[k-1] if k>=1 and k<=len(res) else None
#中序遍历——非递归
def traversal(self,pRoot):
stack = []
res = []
while pRoot or stack :
while pRoot:
stack.append(pRoot)
pRoot = pRoot.left
if stack :
t = stack.pop()
res.append(t)
pRoot = t.right
return res