/**
* 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) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
return isValidBST(root, INT_MIN, INT_MAX);
}
bool isValidBST(TreeNode *root, int min, int max)
{
if(root == NULL) return true;
if(root->val > max || root->val < min) return false;
return isValidBST(root->left, min, root->val-1)
&& isValidBST(root->right, root->val+1, max);
}
};
[Leetcode]Validate Binary Search Tree
最新推荐文章于 2020-10-15 09:59:45 发布