data-structures 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
peak(), enqueue(), dequeue(), print()
3
Q
What must you do to access the value at an arbitrary point in a queue (not just the “front”)?
A
Prior items need to be dequeued firs before it’s enqueued.