Question I

What is the complexity of insertion sort? Explain how you derive that? Given the postfix notation 2 3 4 + 5 6 * Derive the infix notation and draw the math expression tree Assume the following list of objects with keys: 27, 18, 40, 31, 5, 20 Show the resulting array list after it is heapified for the largest key. Continue with previous heap problem, show the resulting list after an object with key of 15 is added. Given node n in a heap, how do you find the parent of this node? Assume the following list of objects with keys: 7, 28, 40, 31, 5 The hash table size is 10 and the hash function is modulo 3. With quadratic probing method, show the resulting hash table. Continue with the above hash question, write the hash table definition (.h). You can assume the object is item