class Solution {
public boolean isValidBST(TreeNode root) {
boolean l = true;
boolean r = true;
TreeNode nodeLeft = root.left;
TreeNode nodeRight = root.right;
if(root == null) return true;
if(root.left != null){
if(root.val <= root.left.val) return false;
else{
while(nodeLeft.right != null){
if(root.val <= nodeLeft.right.val) return false;
nodeLeft = nodeLeft.right;
}
l = isValidBST(root.left);
}
}
if(root.right != null){
if(root.val >= root.right.val) return false;
else{
while(nodeRight.left != null){
if(root.val >= nodeRight.left.val) return false;
nodeRight = nodeRight.left;
}
r = isValidBST(root.right);
}
}
return l && r;
}
}
要考虑到左孩子中的最大值不能超过节点值,右孩子的最小值不能小于节点值,右孩子的值大于节点值,左孩子的值小于节点值,维持这个逻辑递归就行了
递归官方题解
class Solution {
public boolean isValidBST(TreeNode root) {
return isValidBST(root, Long.MIN_VALUE, Long.MAX_VALUE);
}
public boolean isValidBST(TreeNode node, long lower, long upper) {
if (node == null) {
return true;
}
if (node.val <= lower || node.val >= upper) {
return false;
}
return isValidBST(node.left, lower, node.val) && isValidBST(node.right, node.val, upper);
}
}
作者:LeetCode-Solution
链接:https://leetcode-cn.com/problems/validate-binary-search-tree/solution/yan-zheng-er-cha-sou-suo-shu-by-leetcode-solution/
来源:力扣(LeetCode)
著作权归作者所有。商业转载请联系作者获得授权,非商业转载请注明出处。
迭代的中序遍历即可
class Solution {
public boolean isValidBST(TreeNode root) {
Deque<TreeNode> stack = new LinkedList<TreeNode>();
double inorder = -Double.MAX_VALUE;
while (!stack.isEmpty() || root != null) {
while (root != null) {
stack.push(root);
root = root.left;
}
root = stack.pop();
// 如果中序遍历得到的节点的值小于等于前一个 inorder,说明不是二叉搜索树
if (root.val <= inorder) {
return false;
}
inorder = root.val;
root = root.right;
}
return true;
}
}
作者:LeetCode-Solution
链接:https://leetcode-cn.com/problems/validate-binary-search-tree/solution/yan-zheng-er-cha-sou-suo-shu-by-leetcode-solution/
来源:力扣(LeetCode)
著作权归作者所有。商业转载请联系作者获得授权,非商业转载请注明出处。