Пример #1
0
 //O(log(n) time complexity;
 public TV GetValue(TK key)
 {
     return(binarySearchTree
            .Find(new TreeDictionaryNode <TK, TV>(key, default(TV)))
            .Value
            .Value);
 }
 //O(log(n) time complexity;
 public V GetValue(K key)
 {
     return(binarySearchTree
            .Find(new TreeDictionaryNode <K, V>(key, default(V)))
            .Value
            .Value);
 }
Пример #3
0
 public RangeTreeNode <T> Find(T value)
 {
     return(tree.Find(new RangeTreeNode <T>(value)).Value);
 }