private T NextLargestRec(T key, BTPosition<T> node) {

		T found = null;

		if (node.getLeft() != null) {
			found = NextLargestRec(key, node.getLeft());
		}

		if (comp.compare(node.element(), key) > 0 && found == null) {
			found = node.element();
		}

		if (node.getRight() != null && found == null) {
			found = NextLargestRec(key, node.getRight());
		}

		return found;

	}