[leetcode tree]98. Validate Binary Search Tree
Given a binary tree, determine if it is a valid binary search tree (BST).
Assume a BST is defined as follows:
- The left subtree of a node contains only nodes with keys less than the node's key.
- The right subtree of a node contains only nodes with keys greater than the node's key.
- Both the left and right subtrees must also be binary search trees.
Example 1:
2 / \ 1 3
Binary tree [2,1,3]
, return true.
Example 2:
1 / \ 2 3
Binary tree [1,2,3]
, return false.
先中序遍历树到数组flag,flag中必定是从小到大排列,如果不是,return false
1 class Solution(object): 2 def isValidBST(self, root): 3 flag = [] 4 self.isv(root,flag) 5 for i in range(1,len(flag)): 6 if flag[i]<=flag[i-1]: 7 return False 8 return True 9 def isv(self,root,flag): 10 if root == None: 11 return 12 self.isv(root.left,flag) 13 flag.append(root.val) 14 self.isv(root.right,flag)
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】凌霞软件回馈社区,博客园 & 1Panel & Halo 联合会员上线
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】博客园社区专享云产品让利特惠,阿里云新客6.5折上折
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步