98. 验证二叉搜索树
方法一：辅助数组
/**
* Definition for a binary tree node.
* function TreeNode(val, left, right) {
* this.val = (val===undefined ? 0 : val)
* this.left = (left===undefined ? null : left)
* this.right = (right===undefined ? null : right)
* }
*/
/**
* @param {TreeNode} root
* @return {boolean}
*/
var isValidBST = function (root) {
let arr = [];
const buildArr = (root) => {
if (root) {
buildArr(root.left);
arr.push(root.val);
buildArr(root.right);
}
}
buildArr(root);
for (let i = 1; i < arr.length; ++i) {
if (arr[i] <= arr[i - 1])
return false;
}
return true;
};
方法二：递归
/**
* Definition for a binary tree node.
* function TreeNode(val, left, right) {
* this.val = (val===undefined ? 0 : val)
* this.left = (left===undefined ? null : left)
* this.right = (right===undefined ? null : right)
* }
*/
/**
* @param {TreeNode} root
* @return {boolean}
*/
var isValidBST = function (root) {
let pre = null;
const inOrder = (root) => {
if (root === null) {
return true;
}
let left = inOrder(root.left);
if (pre !== null && pre.val >= root.val) {
return false;
}
pre = root;
let right = inOrder(root.right);
return left && right;
}
return inOrder(root);
};
扫一扫
1048
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
