【Leetcode】Validate Bunary Search Tree (Tree Judge)
来源:互联网 发布:json数据解析步骤 编辑:程序博客网 时间:2024/05/29 19:45
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.
helper用于判断每一个节点的左界和右界,
往左走的时候,左界不变,而右界为当前节点,
往右走的时候,左界为当前节点,而右界不变。
压栈思路:先将全部左节点压入,然后弹出左节点压右节点。在压栈的过程中先比较根节点是否为空,再判断根节点的左右界。
public boolean isValidBST(TreeNode root) {return helper(root, Integer.MIN_VALUE, Integer.MAX_VALUE); } private boolean helper(TreeNode root, int min, int max) {if (root == null)return true;if(root.val<=min || root.val>=max) return false;boolean left = helper(root.left, min, root.val);boolean right = helper(root.right, root.val, max);return left&&right; }
0 0
- 【Leetcode】Validate Bunary Search Tree (Tree Judge)
- LeetCode: Validate Binary Search Tree
- [Leetcode] Validate Binary Search Tree
- LeetCode : Validate Binary Search Tree
- [LeetCode] Validate Binary Search Tree
- [LeetCode] Validate binary search tree
- [LeetCode]Validate Binary Search Tree
- [Leetcode]Validate Binary Search Tree
- [leetcode]Validate Binary Search Tree
- LeetCode-Validate Binary Search Tree
- [leetcode] Validate Binary Search Tree
- LeetCode - Validate Binary Search Tree
- [LeetCode] Validate Binary Search Tree
- Leetcode Validate Binary Search Tree
- LeetCode | Validate Binary Search Tree
- LeetCode - Validate Binary Search Tree
- Leetcode: Validate Binary Search Tree
- 【Leetcode】Validate Binary Search Tree
- 输出菱形
- Java基础笔记-第十四记
- DNS服务导致的SQLPLUS登陆缓慢
- 机器学习实践中的 7 种常见错误
- Android SDK Manager更新被墙解决办法
- 【Leetcode】Validate Bunary Search Tree (Tree Judge)
- 第11 周 项目6-回文.素数(1)
- DLL Hell的解决方案
- css绝对定位 自适应宽度的问题
- 提高存款准备金率意味什么?
- 【Leetcode】Maximum Depth of Binary Tree (Tree Judge)
- 交叉归档导致的ora-16146
- BitMap高效显示策略(四):使用DiskLruCache作为硬盘缓存
- 【Android】启动其他Activity并返回结果