Integer res = null;
boolean flag =true;
public boolean isValidBST(TreeNode root) {
if (root == null) return true;
isValidBST(root.left);
if (res == null) res = root.val;
else if (root.val <= res) flag = false;
else {
res = root.val;
}
isValidBST(root.right);
return flag;
}
leetcode 0405 检查二叉搜索树
最新推荐文章于 2024-07-09 23:19:55 发布