Binary Search Tree

The final project of CSCI 211, a great way to end the semester. Trees become a very important data structure in CSCI 311 with structures like AVL, max/min Heap, and graphs.