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 binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
int prev;
bool isValidBST_(TreeNode *root)
{
if(!root) return true;
bool bleft = isValidBST_(root->left);
if(!bleft) return false;
if(prev == INT_MAX)
prev = root->val;
else if(root->val<=prev)
return false;
prev = root->val;
return isValidBST_(root->right);
}
bool isValidBST(TreeNode *root) {
prev = INT_MAX;
return isValidBST_(root);
}
};