给定一颗二叉搜索树，请找到第k个节点

'''
中序遍历

'''

class TreeNode: def __init__(self, x): self.val = x self.left = None self.right = None

class KNode: def KthNode(self, pRoot, k): global result result = [] middle = self.midorder(pRoot) if k <= 0 or len(middle) < k: return None else: return middle[k - 1] def midorder(self, pRoot): if not pRoot: return [] self.midorder(pRoot.left) result.append(pRoot) self.midorder(pRoot.right) return result root = TreeNode(10)
left = TreeNode(6)
right = TreeNode(15)
root.left = left
root.right = right

left1 = TreeNode(11)
right1 = TreeNode(20)

right.left = left1
right.right = right1

print(KNode().KthNode(root, 4).val)

  

 

  
1
  
2
  
3
  
4
  
5
  
6
  
7
  
8
  
9
  
10
  
11
  
12
  
13
  
14
  
15
  
16
  
17
  
18
  
19
  
20
  
21
  
22
  
23
  
24
  
25
  
26
  
27
  
28
  
29
  
30
  
31
  
32
  
33
  
34
  
35
  
36
  
37
  
38
  
39
  
40
  
41
  
42
 

15

  

 

  
1
 

89 - Python一行代码实现循环移位

文章来源: ruochen.blog.csdn.net，作者：若尘，版权归原作者所有，如需转载，请联系作者。

原文链接：ruochen.blog.csdn.net/article/details/105175903