思路
二叉搜索树的中序遍历是升序
代码
# -*- 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
vals = []
def midTraverse(root):
if root == None:return
midTraverse(root.left)
vals.append(root)
midTraverse(root.right)
midTraverse(pRoot)
if k > len(vals) or k == 0:
return None
return vals[k-1]