题目:
Given a binary tree, determine if it is a valid binary search tree (BST).
Assume a BST is defined as follows:
- The left subtree of a node contains only nodes with keys less than the node's key.
- The right subtree of a node contains only nodes with keys greater than the node's key.
- Both the left and right subtrees must also be binary search trees.
代码:
/**
* 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 isValid(root,LONG_MIN,LONG_MAX);
}
bool isValid(TreeNode* root, long min, long max)
{
if(root==NULL)
return true;
if(root->val<=min or root->val>=max)
return false;
return isValid(root->left,min,root->val) and isValid(root->right,root->val,max);
}
};