BST and Splay Trees

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. Posted solutions are meant to be 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 complete the form. Please provide a valid email address and we will get back to you within 24 hours. Payment is through PayPal, Buy me a Coffee or Cryptocurrency. We are a nonprofit organization however we need funds to keep this organization operating and to be able to complete our research and development projects.