Given a binary tree, determine if it is a valid binary search tree (BST). 题解: 代码 public class Solution { List<Integer> list = new ArrayList<Integer>(); public boolean isValidBST(TreeNode root) { //二叉查找数 如果中序遍历结果是一个递增的排序序列 if (root == null) return true; if (root.left == null && root.right == null) return true; inOrderTraversal(root);//中序遍历 for (int i = 1; i < list.size(); i++) { if (list.get(i) <= list.get(i - 1)) return false; } return true; } public void inOrderTraversal(TreeNode root){ if (root == null) return; inOrderTraversal(root.left); list.add(root.val); inOrderTraversal(root.right); } }