题目:
给定一颗二叉搜索树,请找出其中的第k大的结点。例如, 5 / \ 3 7 /\ /\ 24 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):
self.arr = []
self.midTravel(pRoot)
return self.arr[k-1] if 0 < k <= len(self.arr) else None
def midTravel(self,pRoot):
if pRoot == None:
return
self.midTravel(pRoot.left)
self.arr.append(pRoot)
self.midTravel(pRoot.right)
# write code here