// https://leetcode-cn.com/problems/validate-binary-search-tree/
// Definition for a binary tree node.
class TreeNode {
val: number
left: TreeNode | null
right: TreeNode | null
constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) {
this.val = (val===undefined ? 0 : val)
this.left = (left===undefined ? null : left)
this.right = (right===undefined ? null : right)
}
}
function helper(root: TreeNode | null, lower, upper): boolean
{
if(root === null)
{
return true;
}
if(root.val <= lower || root.val >= upper)
{
return false;
}
return helper(root.left, lower, root.val) && helper(root.right, root.val, upper);
}
function isValidBST(root: TreeNode | null): boolean {
return helper(root, -Infinity, Infinity);
};