题目链接
https://leetcode.com/problems/validate-binary-search-tree/
代码
class Solution {
public:
bool isValidBST(TreeNode* root) {
return dfs(root, NULL, NULL);
}
bool dfs(TreeNode* root, TreeNode* lower, TreeNode* upper) {
if (root == NULL) {
return true;
}
if (lower != NULL && root->val <= lower->val) {
return false;
}
if (upper != NULL && root->val >= upper->val) {
return false;
}
return dfs(root->left, lower, root) && dfs(root->right, root, upper);
}
};
网友评论