思路:
DFS。
/**
* 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 {
private:
bool isValid(TreeNode* root, long left, long right) {
if(root == NULL) return true;
return root->val > left && root->val < right && isValid(root->left, left, root->val) && isValid(root->right, root->val, right);
}
public:
bool isValidBST(TreeNode* root) {
return isValid(root, LONG_MIN, LONG_MAX);
}
};