Multiple Choice
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) Traditional linked list
B) Stack
C) Queue
D) Tree
Correct Answer:
Verified
Correct Answer:
Verified
Related Questions
Q8: If the two-dimensional array X were stored
Q24: Define each of the following:<br>A. Primitive data
Q26: If the variable named Box had the
Q27: The table below represents a portion of
Q30: The table below represents a portion of
Q31: The table below represents a portion of
Q35: Which of the following is static in
Q39: What is the distinction between a type
Q40: Why is a queue normally implemented as
Q44: Suppose a binary tree contained the nodes