leetcode #98. Validate Binary Search Tree

Given a binary tree, determine if it is a valid binary search tree (BST).

Assume a BST is defined as follows:

The left subtree of a node contains only nodes with keys less than the node’s key.
The right subtree of a node contains only nodes with keys greater than the node’s key.
Both the left and right subtrees must also be binary search trees.

Example 1:

2

/
1 3

Input: [2,1,3]
Output: true
Example 2:

5

/
1 4
/
3 6

Input: [5,1,4,null,null,3,6]
Output: false
Explanation: The root node’s value is 5 but its right child’s value is 4.

看见树我第一个想到可以用递归
第二个想到链表

本题递归不难，唯一重点是long.min_value /max_value
因为数可能是正负无穷

 public boolean isValidBST(TreeNode root) {
        if (root == null) return true;
        return valid(root, Long.MIN_VALUE, Long.MAX_VALUE);
    }
    public boolean valid(TreeNode root, long low, long high) {
        if (root == null) return true;
        if (root.val <= low || root.val >= high) return false;
        return valid(root.left, low, root.val) && valid(root.right, root.val, high);
    }```

思路二
利用中序遍历 从下往上一次比较
[中序思路](http://www.voidcn.com/article/p-wjfdkhzi-ys.html)
class Solution {
    
    List<Integer> list = new ArrayList<>();
    public boolean isValidBST(TreeNode root) {
   
        
        //思路二 中序遍历
        
        
        
        if(root == null){
            return true;
        }
        
        if(root.left ==null && root.right == null){
            return true;
        }
        
        //中序遍历tree 并且添加到list
        inOrder(root);
        
        //判断是否小于前一个（中序遍历按左中右， 左《中《右）
        for(int i =1;i<list.size();i++){
            if(list.get(i)<=list.get(i-1)){
                return false;
            }
        }
            return true;
        
        
}
    
    public void inOrder(TreeNode root){
        if(root!=null){
            inOrder(root.left);
            list.add(root.val);
            inOrder(root.right);
        }
    }
}

知识点
获取list长度 用 .size（）
获取list第i位 用 list.get(i)

递归更加有效率