In this school project, my professor Dr. Thomas VanDrunen wrote 3 different implementations of binary search tree, and my task was to formulate a question about their relative performance, write a test to answer my question, and then report on the results.

Essentially what I tested was how the variety of data going into (and being called out of) the trees affected their performance times (evaluated for different amounts of data). My presentation, along with all of the project files, can be found in the GitHub repository.

GitHub link