Extra Credit:

Implement a BST tree.
You may use structs or classes.
In specific be sure to implement a method to
display (depth first search "in-order"), search,and insert.

For tons more extra credit, implement AVL and/or Red-Black (one is
much easer than the other).