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);
}
}