Note:
除了递归判断左右两边是不是二叉搜索树之外,还要判断一下子左边的是不是都要比右边的小,传参数来判断子树的取值范围
代码如下:
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
bool isValidBST(TreeNode* root) {
return dfs(root, LONG_MIN, LONG_MAX);
}
bool dfs(TreeNode* root, long long lower, long long upper){
if(!root) return true;
if(root -> val >= upper || root -> val <= lower) return false;
return dfs(root -> left, lower, root -> val) && dfs(root -> right, root -> val, upper);
}
};