data-structures-queues Flashcards
1
Q
What does the acronym FIFO mean?
A
First in first out
2
Q
What methods are available on a Queue data structure?
A
Enqueue, dequeue, peek
3
Q
What must you do to access the value at an arbitrary point in a queue (not just the “front”)?
A
You have to use the dequeue and enqueue methods to reach the values further in (can use loops)