//O(log(n) time complexity;
public bool ContainsKey(TK key)
{
return(binarySearchTree
.HasItem(new TreeDictionaryNode <TK, TV>(key, default(TV))));
}
//O(log(n) time complexity;
public bool Contains(V value)
{
return(binarySearchTree
.HasItem(value));
}