Multiple Choice
Which data structure represents a waiting line and limits insertions to be made at the back of the data structure and limits removals to be made from the front?
A) Stack.
B) Queue.
C) Binary tree.
D) Linked list.
Correct Answer:

Verified
Correct Answer:
Verified
Related Questions
Q5: Which of the following tasks would a
Q6: The pointer member in a self-referential class
Q7: How many pointers are contained as data
Q8: _ is not an advantage of linked
Q9: Which of the following is not a
Q11: A queue performs the following commands (in
Q12: What kind of linked list begins with
Q13: A linked list has the functions insertAtFront,
Q14: A stack is initially empty, then the
Q15: For a non-empty linked list, select the