Question: linked list -stack - queue Considering the famous three data-structures: Queue, Stack, and Linked-list, answer the following questions: a) Given three values: 5, 8, and
linked list -stack - queue 
Considering the famous three data-structures: Queue, Stack, and Linked-list, answer the following questions: a) Given three values: "5, 8, and 4", draw an llustrative figure to show how these values will be stored in each data-structure. (3 marks) b) What is the average complexity of inserting new element and finding the smallest element in each of these data-structures? (3 marks) c) Which of them suite better the data that change frequently? (2 marks) d) Which of them suite better the case of last-in-first-out? (2 marks)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
