We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Trees: Is This a Binary Search Tree?
  2. Discussions

Trees: Is This a Binary Search Tree?

  • jongray93
     + 29 comments

    Here is a clean java solution.

    boolean checkBST(Node root) {
	return check(root,Integer.MIN_VALUE,Integer.MAX_VALUE);
}
boolean check(Node n, int min, int max){
	if(n==null)
		return true;
	if(n.data <= min || n.data >= max)
		return false;
	return check(n.left, min, n.data) 
		&& check(n.right, n.data, max);
}