Report (30 points)Write a brief report that includes the following:1. A description of the assignment objective, how to compile and run your programs, and an explanationof your program structure (i.e. a description of the classes you use, the relationship between the classes,and the functions or classes in addition to those in the lecture notes).2. A brief description of the data structure you create (i.e., a theoretical definition of the data structureand the actual data arrangement in the classes).3. A description of how you implement the calculation of individual search cost and average search cost. Isthe implementation associated with the operations find, insert, remove? Analyze the time complexityofupdatingthe search cost of an individual node andsumming upthe search costs over all thenodes.4. Give individual search cost in terms ofnusing big-O notation. Analyze and give the average searchcosts of a perfect binary tree and a linear binary tree using big-O notation, assuming that the followingformulas are true (ndenotes the total number of integers).∑log2(n+1)-1d=02d(d+ 1)≃(n+ 1)·log2(n+ 1)−nand∑nd=1d≃n(n+ 1)/25. Include a table and a plot of average search costs you obtain. In your discussions of the experimentalresults, compare the curves of search costs with your theoretical analysis results in item 4.3
This is the end of the preview.
access the rest of the document.