中序遍历,就是顺序数列,直接取下标
熟悉一下python的类的操作,啥都加self.
树的空节点采用的None,而不是NULL
class Solution:
def __init__(self):
self.p = []
def mid_tree(self, root: TreeNode):
if(root is None):
return
self.mid_tree(root.left)
self.p.append(root.val)
self.mid_tree(root.right)
def kthSmallest(self, root: TreeNode, k: int) -> int:
self.mid_tree(root)
print(self.p)
return self.p[k-1]