Miscellany

	public boolean search(Comparable key) {	    return search(key, root);	}		private boolean search(Comparable key, Node currentNode) {		if(currentNode != null) {			if(key.compareTo(currentNode.key) == 0) {				return true;			} else if(currentNode.left != null && key.compareTo(currentNode.key) < 0) {				return search(key, currentNode.left);			} else  if(currentNode.right != null && key.compareTo(currentNode.key) > 0) {				return search(key, currentNode.right);			}			}		return false;	}