Class ihie SC220 Celebration of Knowledge 2 rsion A pts): Match the activity to the WORST CASE running time: E. Other tching[14 E.O(n2) B.O(n) C.o(nlogn)D.Oflogn) 1. Adding 42 to the end of a linked list Adding 42 to the end of an array Finding if 42 is in an array Finding the 42nd value in an array Finding the 42nd value in a linked list Finding if 42 is in a linked list Finding 42 in an AVL tree Adding 42 to an AVL tree 2, 3. 5. 6. -7. 8. 9 Sorting an AVL tree 10. Adding 42 to a Binary Heap 11. 12. Making a linked list 13. Making a Binary Heap 14. Sorting a Binary Heap Making an AVL tree Extremely Short (one or 2 words or numbers) Answers (12 pts): Give a series of 5 numbers that would result in the worst case for creating/inserting into/finding in tree. 1. 2. Why is the worst case for a binary search tree worse than the worst case for an AVL tree? 3. What is the maximum possible number of nodes in a binary heap whose root is of height 6 (assume height of 1)? 4. What is the minimum possible number of nodes in a binary heap whose root is of height 6? 5. Is the max number of nodes of an AVL tree whose root is of height 6 the same as that of a binary 6. s the min number of nodes in an AVL tree whose root is of height 6 the same as that of a binary h (S pts) Create a (plain, not AVL) binary Search Tree out of the following sequence ofn sequence of numbers:83,74,2 2