BinarySearchTreeTK, TV Class
public class BinarySearchTree<TK, TV> where TK : Object, IComparable<TK>
Thetype exposes the following members.
Balances a given tree.
Deletes a node from the tree.
Determines whether the specified object is equal to the current object.(Inherited from Object.)
Allows an object to try to free resources and perform other cleanup operations before it is reclaimed by garbage collection.(Inherited from Object.)
Finds the value of a node whose key is the largest, smaller than the given. Only works with a balanced tree. It may be necessary to call BalanceTree before this method.
Returns the minimum value in the tree.
Traverses the tree to find and return a node with a certain value.
Serves as the default hash function.(Inherited from Object.)
Gets the Type of the current instance.(Inherited from Object.)
Inorder traversal of the tree.
Inserts a new node in a existing tree.
Creates a shallow copy of the current Object.(Inherited from Object.)
Preorder traversal of the tree. Visits the root, then visits the left sub-tree, after that visits the right sub-tree. Retruns the keys.
Preorder traversal of the tree. Visits the root, then visits the left sub-tree, after that visits the right sub-tree. Retruns the values.
Returns a string that represents the current object.(Inherited from Object.)