Пример #1
0
 /// <summary>
 /// Remove the given value.
 /// Time complexity: O(log(n)).
 /// </summary>
 /// <param name="value">The value to remove.</param>
 public void Remove(T value)
 {
     binarySearchTree.Delete(value);
 }
Пример #2
0
 /// <summary>
 /// Remove the given key.
 /// Time complexity: O(log(n)).
 /// </summary>
 public void Remove(K key)
 {
     binarySearchTree.Delete(new SortedDictionaryNode <K, V>(key, default(V)));
 }