知识点:
题目描述:
给定一棵二叉搜索树,请找出其中的第k小的结点。例如, (5,3,7,2,4,6,8) 中,按结点数值大小顺序第三小结点的值为4。
思路:
对二叉搜索树中序遍历,遍历得到第k个节点。
详解:
方法:(递归法)
# -*- 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
global res
res=[]
self.minnode(pRoot)
if k<=0 or len(res)<k:
return None
else:
return res[k-1]
def minnode(self,root):
if not root:
return None
self.minnode(root.left)
res.append(root)
self.minnode(root.right)
参考链接:
https://blog.csdn.net/qq_36936730/article/details/104790829