Implementation binary search tree
- add - Add the given key and object to hash table.
- find - Finds key in tree
- min - Returns node with min key
- max - Returns node with max key
- height - Returns the height of the tree in nodes, 0 if empty
- count - Returns the number of nodes stored in the tree
- successor - Returns the node that contains next key
- predecessor - Returns the node contains previous key