Capital One Interview Question
Validate Binary Search Tree
Interview Answer
Anonymous
Sep 27, 2017
public boolean isValidBST(TreeNode croot, long min, long max) { if(croot == null) { return true; } else if(croot.val >= max || croot.val <= min) { return false; } return isValidBST(croot.left, min, croot.val) && isValidBST(croot.right, croot.val, max); } public boolean isValidBST(TreeNode root) { return isValidBST(root, Long.MIN_VALUE, Long.MAX_VALUE); }