public E get(E key) {
		if (root == null) return null;
		Node<E> node = root;
		int compareResult;
		while ((compareResult = node.value.compareTo(key)) != 0) {
			if (compareResult > 0) {
				if (node.left != null) {
					node = node.left;
				} else {
					return null;
				}
			} else {
				if (node.right != null) {
					node = node.right;
				} else {
					return null;
				}
			}
		}
		return node.value;
	}