Validate Binary Search Tree Leetcode Recursion 3 line solution

[@msdhoni5324]

Super explanation

[@himcooljig1]

super explanation i was stuck on it for long

[@AmanRaj-gy6qv]

Great explanation i was just stuck with this weird overflow error, Thanks for the explanation

[@mdkashif7808]

Good mam i can understand easy

[@Secret_Superstar_Girl]

Ma'am what will be the value of Max in right subtree call...

[@aiyappamn326]

As new test cases are added change the INT_MIN and INT_MAX class Solution { public: bool checkValidBst(TreeNode* root,long long min,long long max){ if(root==NULL) return true; if(root->valval>=max) { return false; } return checkValidBst(root->left,min,root->val) && checkValidBst(root->right,root->val,max); } bool isValidBST(TreeNode* root) { if(root->left==NULL && root->right==NULL) return true; return checkValidBst(root,LLONG_MIN, LLONG_MAX); } };