LC验证二叉搜索树(JavaScript实现)

/** &＃64;lc app&＃61;leetcode.cn id&＃61;98 lang&＃61;Javascript** [98] 验证二叉搜索树*/// &＃64;lc code&＃61;start
/*** Definition for a binary tree node.* function TreeNode(val, left, right) {* this.val &＃61; (val&＃61;&＃61;&＃61;undefined ? 0 : val)* this.left &＃61; (left&＃61;&＃61;&＃61;undefined ? null : left)* this.right &＃61; (right&＃61;&＃61;&＃61;undefined ? null : right)* }*/
/*** &＃64;param {TreeNode} root* &＃64;return {boolean}*/let verifyBST &＃61; (root,min,max) &＃61;>{if(!root) return true;if(root.val>&＃61;max || root.val<&＃61;min) return false;return verifyBST(root.left,min,root.val) && verifyBST(root.right,root.val,max)
}
var isValidBST &＃61; function(root) {return verifyBST(root,-2e32,2e32)
};
// &＃64;lc code&＃61;end