leetcode 98. Validate Binary Search Tree
2017-02-15 13:06
190 查看
class Solution {
public:
bool isValidBST(TreeNode* root)
{
return process(root, 2147483649, -2147483649);
}
private:
bool process(TreeNode* root, long long max, long long min)
{
if (root == nullptr)
{
return true;
}
if (root->val >= max ||root->val <= min)
{
return false;
}
return process(root->left, root->val, min) &&
process(root->right, max,root->val);
}
};
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- 【LeetCode】98. Validate Binary Search Tree 解法，中序遍历，搜索二叉树合法性
- LeetCode 98. Validate Binary Search Tree （Python）
- LeetCode 98. Validate Binary Search Tree 题解
- 98. Validate Binary Search Tree-leetcode-java
- LeetCode 98. Validate Binary Search Tree（校验二叉搜索树）
- [leetcode] 98. Validate Binary Search Tree (medium)
- 【LeetCode】98. Validate Binary Search Tree(Medium)解题报告
- Leetcode 98. Validate Binary Search Tree (Medium) (cpp)
- [leetcode]98. Validate Binary Search Tree -- JavaScript 代码
- 【LeetCode】98. Validate Binary Search Tree -判断是否为二叉排序树
- leetcode -- 98. Validate Binary Search Tree【假设法 + 局部性】
- Leetcode 98. Validate Binary Search Tree C++及javascript解答，不同语言不同玩法
- 【LeetCode】98. Validate Binary Search Tree (2 solutions)
- [Leetcode]Validate Binary Search Tree
- Leetcode 108. Convert Sorted Array to Binary Search Tree 有序数组转化BST 解题报告
- LeetCode ---Convert Sorted List to Binary Search Tree
- leetcode99 Recover Binary Search Tree java 算法
- leetcode [Convert Sorted Array to Binary Search Tree]//待整理多种解法
- [Leetcode 98] Validate Binary Search Tree
- [LeetCode] Convert Sorted List to Binary Search Tree