C# (CSharp) DataStructures.Trees BinarySearchTreeMap Beispiele

Beispiel #1

            public BinarySearchTreePostOrderEnumerator(BinarySearchTreeMap <TKey, TValue> tree)
            {
                this.tree = tree;

                //Build queue
                traverseQueue = new Queue <BSTMapNode <TKey, TValue> >();
                visitNode(this.tree.Root);
            }

Beispiel #2

 public void Dispose()
 {
     current = null;
     tree    = null;
 }