OBJ: * Design and implement programs in a programming language demonstrating the use of the Search Tree Structures representation. * Analyse the complexity of algorithms and the performance of the...

Extracted text: OBJ: * Design and implement programs in a programming language demonstrating the use of the Search Tree Structures representation. * Analyse the complexity of algorithms and the performance of the algorithms and data structure Questions 1. Implement a program using C++ demonstrating the use of Binary search tree (BST) and also the used of Splay tree structure "Use rental system as case study" 2 Analysis Report (Practical Complexities): Compare BST structure with Spay tree structure. Issues need to be considered in the report: i. Take note of the insertion operation, because you add an item to the tree only if it is not already present, does the time required for an insertion increase? Discuss the issue in the analysis report. ii. Experiment with the search structure in random mode with a selected maximum input and determine the optimal tree order. the report should include the insert and search times for a few of the tree orders experimented with. iii. Run your program in random mode for maximum input and tabulate the reported average insert and search times for each of the tree structures iv. Show these average times also using bar charts. For the tree codes or solutions, use the optimal tree order determined in (ii) Based on the experiments, what recommendations can you make about a good v. way to implement the problem whose expected size is the suggested maximum size?