public SortedHashSet() { binarySearchTree = new RedBlackTree <T>(); }
public SortedDictionary() { binarySearchTree = new RedBlackTree <SortedDictionaryNode <K, V> >(); }
public void Dispose() { bst = null; enumerator = null; }
internal SortedDictionaryEnumerator(RedBlackTree <SortedDictionaryNode <K, V> > bst) { this.bst = bst; this.enumerator = bst.GetEnumerator(); }