private boolean search(T key, Node<T> node) {
		if (node != null) {
			if (key.compareTo(node.getValue()) == 0)
				return true;
			if (key.compareTo(node.getValue()) < 0)
				return search(key, (Node<T>) node.getLeftChild());
			else
				return search(key, (Node<T>) node.getRightChild());
		}
		return false;

	}

	@Override
	public boolean search(T key) {
		return this.search(key, root);
	}