public boolean checkIfBinarySearchTree(Node root) {
		if(root!=null) {
			if(root.left != null && maxValue(root.left) > root.data)
				return false;
			else if(root.right != null && minValue(root.right) < root.data)
				return false;
			else
				return (checkIfBinarySearchTree(root.left) && checkIfBinarySearchTree(root.right));				
		} else
			return true;
	}