解法1:中序遍历进行排序,数组取第k-1个数值
class Solution:
# 返回对应节点TreeNode
def KthNode(self, pRoot, k):
# write code here
if pRoot == None:
return
result = self.midlevel(pRoot)
return TreeNode(result[k-1]) if 0 < k <=len(result) else None
def midlevel(self,root):
if root == None:
return []
return self.midlevel(root.left) + [root.val] + self.midlevel(root.right)