/**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
bool isValidBST_aux(TreeNode *node,int leftval,int rightval)
{
if(node==NULL)
return true;
return leftval<node->val&&node->val<rightval&&isValidBST_aux(node->left,leftval,node->val)&&isValidBST_aux(node->right,node->val,rightval);
}
bool isValidBST(TreeNode *root) {
return isValidBST_aux(root,INT_MIN,INT_MAX);
}
};
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
bool isValidBST_aux(TreeNode *node,int leftval,int rightval)
{
if(node==NULL)
return true;
return leftval<node->val&&node->val<rightval&&isValidBST_aux(node->left,leftval,node->val)&&isValidBST_aux(node->right,node->val,rightval);
}
bool isValidBST(TreeNode *root) {
return isValidBST_aux(root,INT_MIN,INT_MAX);
}
};