public V get(K key) {
		if (root == null)
			return null;
		
		Node node = root;
		
		while (true) {
			if (key.compareTo(node.mKey) < 0) {
				if (node.left == null)
					return null;
				else
					node = node.left;
			} else if (key.compareTo(node.mKey) > 0) {
				if (node.right == null)
					return null;
				else
					node = node.right;
			} else
				return node.mValue; // (key.compareTo(node.mKey) == 0)
		}
	}