class SortedBinaryTree < Object
Create a new SortedBinaryTree. TODO: Should a Hash be used to create the tree, or should a set of [key => value]* objects be used, like with Hash itself? Would this be possible?
|hash||a hash with which to initialize the tree.|
Construct a Sorted BinaryTree from a Hash (or any other data structure with an each method that iterates through key/value pairs).
Returns: a new BinaryTree containing the data from Hash.
Retrieve an element from the tree.
Returns: the element associated with key, or @default if there is no such key.
Insert a new element into the tree. If there is already an element in the tree with the given key, then the given key/value pair will replace the element.
Returns: the value that was inserted.
store is an alias for =.
each_pair is an alias for each.
reverse_each_pair is an alias for reverse_each.
length is an alias for size.
Given a key, find a node associated with that key.
|the||key to search for.|
Returns: the node associated with key.
class BinarySearchTree < Object