/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
bool isValidBST(TreeNode* root) {
return helper(root, LONG_MIN, LONG_MAX);
/*if (root == NULL)return true;
if (root->left->val >= root->val||root->val >= root->right->val)
return false;
return isValidBST(root->left)&&isValidBST(root->right);*/
}
bool helper(TreeNode*root, long mi,long ma) {
if (root == NULL)return true;
if (root->val <= mi || root->val >= ma)return false;
else return helper(root->left, mi, root->val) && helper(root->right, root->val, ma);
}
};
leetcode 98. 验证二叉搜索树(增加上下界递归)
最新推荐文章于 2020-12-30 20:45:13 发布