CS 200 Midterm: CS 200 CSU Midterm2 04
Document Summary
Circle the letter of each statement that is true in each of the statements that follow the beginning statement. Why or why not: [16 pts] fill in the array for the heap that results given the following heap and the commands that follow: Add 21: [8 pts] in assignment 5, the word lists are implemented using a binary search tree. Compare that approach (i. e. , the binary search tree) against storing them in an arraylist which is searched using binary search. State one pro (reason why the binary search tree is a better approach) and one con (reason why the binary search tree is a worse approach). Cons: [8 pts] pick one of the data structures that can be used to implement a map (as listed in class). Name the underlying data structure that you have selected and fill out the following table of worst case big-o values for the computation of the three operations and for the space required.
