NOT MAINTAINED ANYMORE AND NOT UPDATED.

binSearchTree

An ongoing eclipse project written in C++. The final goal is to build a working binary search tree for implementing a dictionary.

For any non-standard variable types:
USE OF THE "TREE" CLASS IS ONLY PERMITTED WITH COMPARISON OPERATORS OVERLOADING.

• Provided with a basic linkedList class.

The interface for binSearchTree:

• get() - Recieves a key and returns the value.
• insert() - Recieves a pair (key, value) and inserts them to the tree. Returns true if the key already existed (and writes the new value instead of the old) or false if the key is a new entry.
• remove() - Recieves a key, removes the pair from the tree and re-builds the tree.
• get_size() - Returns the number of nodes in the tree.
• get_root() - Returns a pointer to the root node of the tree. Shouldn't be used except for debugging, mostly.
• printTree() - Prints the structure of the tree. For easier debugging.
• export_inorder() - In development. For future tree manipulation in O(n) run-time complexity.