CSUF CPSC 131, Fall 2016 Project 3 "Binary Search Tree" (using the data structures learned in CPSC 131)

Group members:

Ada Lovelace adalovelace@csu.fullerton.edu

Charles Babbage charlesbab@csu.fullerton.edu

You need to answer the following question.

Two binary search trees contains exactly the same number of entries of student information but in different orders. Do they give the same performance in terms of key searching or firstname searching? if not, why? use the data you obtain from you code to explain your answer.