二叉搜索樹的第k小的數

class Solution:def kthSmallest(self, root: Optional[TreeNode], k: int) -> int:# 二叉搜索樹的中序遍歷是 升序排列的， 求第k小的，即第k個數self.res = []def fun(root):if not root:returnfun(root.left)if root:self.res.append(root.val)fun(root.right)return fun(root)return self.res[k-1]

驗證二叉搜索樹

class Solution:def isValidBST(self, root: Optional[TreeNode]) -> bool:self.res = []self.flag = Truedef func(root):if not root:returnfunc(root.left)if root:self.res.append(root.val)if len(self.res)>1 and self.res[-1] <= self.res[-2]:self.flag = Falsereturn func(root.right)return func(root)return self.flag