• Tutorials
  • Courses
  • Tracks

queue stl Question 8

Last Updated :
Discuss
Comments

Which of the following statements about the queue container is false?

It is a first-in, first-out (FIFO) data structure.

It has a front and a back, but no random access to elements.

It has a fixed size.

It is implemented as a dynamic array.

Share your thoughts in the comments