public int LCAutil(Node node,int a,int b){
		  if(node == null){
			  System.out.println("root is coming as null");
			  return -1;
		  }
		  
		  if( (node.value >= a && node.value <= b ) ){
			  if( findNodes(node, a) && findNodes(node, b) ){
				  return node.value;
			  }
			  else{
				  return -1;
			  }
		  }
		
		  if(node.value > a && node.value > b){
			  System.out.println("traverse left");
			  return LCA(node.left,a,b);
		  }else{
			  System.out.println("traverse right");
			  return LCA(node.right,a,b);
		  }
		   
	  }