Suppose you were going to retrieve items of data that you would later need to process in the opposite order from that in which they were retrieved.Which of the following would be the best structure in which to store the items?
A) Tree
B) Stack
C) Queue
D) Traditional linked list

Question

Quizplus · Accepted Answer

A stack is a Last-In-First-Out (LIFO) data structure where the last item added to the stack will be the first one to be removed. This means that if we retrieve data and push it onto a stack, we can later pop the items off the stack in reverse order to process them in the opposite order in which they were retrieved. This makes a stack the best choice for storing items of data that need to be processed in the opposite order from which they were retrieved. Trees and traditional linked lists do not guarantee the order of the items when retrieving them and a queue retrieves items in the same order in which they were added, which does not fit the requirement for processing items in the opposite order.

Suppose You Were Going to Retrieve Items of Data That