Implement both Binary Search Tree and Splay Tree. Your main program will read in a list of operations in a file and do the operations accordingly. The format of the file is:

[I|D|F] n

I: Insert
D: Delete
F: Find

Compare the performance of these two trees. Sample input files will be provided.

Academic Honesty!
It is not our intention to break the school's academic policy. Projects posted are only used as a reference and should not be submitted as is. We are not held liable for any misuse of the solutions. Please see the frequently asked questions page for further questions and inquiries.
Kindly fill out the form. Please provide a valid email address and we'll get back to you in less than 24 hours. We will be sending an invoice through PayPal upon confirmation. We are a non profit organization however we need an amount to keep this organization running, and to be able to complete our research and development.