98. 验证二叉搜索树

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public boolean isValidBST(TreeNode root) {
        if (root == null) {
            return Boolean.TRUE;
        }
        List<TreeNode> inorderList = inorder(root);
        List<Integer> inordrInts = new ArrayList<>();
        inordrInts = inorderList.stream().map(treeNode -> treeNode.val).collect(Collectors.toList());
        Set<Integer> setInts = new HashSet<>(inordrInts);
        List<Integer> sortInts = new ArrayList<>(setInts);
        Collections.sort(sortInts);
        if (sortInts.equals(inordrInts))
            return Boolean.TRUE;
        return Boolean.FALSE;
    }

    public List<TreeNode> inorder(TreeNode node) {
        List<TreeNode> list = new ArrayList<>();
        if (node.left != null)
            list.addAll(inorder(node.left));
        list.add(node);
        if (node.right != null)
            list.addAll(inorder(node.right));

        return list;
    }
}

注：这里主要用到的是中序遍历。中序遍历二叉搜索数应该是一个递增的数组。把比较放在中序遍历过程中代码会更简洁。