leetcode: Validate Binary Search Tree
2014-06-16 19:49
561 查看
/**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
bool isValidBST(TreeNode *root) {
if( root == NULL)
return true;
return isValidNode( root->left, root->val, INT_MIN) && isValidNode( root->right, INT_MAX, root->val);
}
bool isValidNode( TreeNode *root, int max, int min){
if( root == NULL)
return true;
if( root->val < max && root->val > min)
return isValidNode( root->left, root->val, min) && isValidNode( root->right, max, root->val);
else
return false;
}
};
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- LeetCode-Validate Binary Search Tree
- 【LeetCode】Validate Binary Search Tree
- ［leetcode］Validate Binary Search Tree
- Leetcode_98 Validate Binary Search Tree
- [LeetCode-12]Validate Binary Search Tree
- LeetCode : Validate Binary Search Tree
- leetcode 94: Validate Binary Search Tree
- Leetcode: Validate Binary Search Tree
- [LeetCode]Validate Binary Search Tree@python
- 【Leetcode】Validate Binary Search Tree
- 【LeetCode】Validate Binary Search Tree 解题报告（Java & Python）
- [leetcode] Validate Binary Search Tree
- leetcode--ValidateBinarySearchTree
- LeetCode: Validate Binary Search Tree
- [leetcode]Validate Binary Search Tree
- LeetCode 98 — Validate Binary Search Tree（C++ Java Python）
- LeetCode || Validate Binary Search Tree
- leetcode第51题（validate-binary-search-tree）
- [LeetCode] Validate Binary Search Tree
- [LeetCode]98.Validate Binary Search Tree