Question 6 (3 points) Assume you implemented our Sorted List ADT using the Linked List as an Array of Nodes approach des
Posted: Tue Jul 12, 2022 8:16 am
- Question 6 3 Points Assume You Implemented Our Sorted List Adt Using The Linked List As An Array Of Nodes Approach Des 1 (118.61 KiB) Viewed 32 times
Question 6 (3 points) Assume you implemented our Sorted List ADT using the Linked List as an Array of Nodes approach described in this section. Assume the size of the array is N. (a) What is the order of growth for the efficiency of initializing the free list? (b) For the method getNode, what is the order of growth? (c) For the method freeNode, what is the order of growth? nodes [0] [1] [2] [3] [4] [5] [6] [7] [8] [9] list 4 free 2 .info Magma Alpha Pi Linked list as an array of nodes Beta Gamma .next 6 5 3 9 7 NUL NUL 8 1 0