题目描述
给定一棵二叉搜索树,请找出其中的第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
if pRoot is None or k==0:
return
result = self.KthNodeCore(pRoot)
if len(result)<k:
return None
return result[k-1]
def KthNodeCore(self, pRoot):
result = []
if not pRoot:
return []
if pRoot.left:
result.extend(self.KthNodeCore(pRoot.left))
result.append(pRoot)
if pRoot.right:
result.extend(self.KthNodeCore(pRoot.right))
return result