Data Structures Flashcards
1
Q
What does the acronym LIFO mean?
A
Last in First Out
2
Q
What methods are available on a Stack data structure?
A
push and pop (most important ones)
3
Q
What must you do to access the value at an arbitrary point in a stack (not just the “top”)?
A
Pop until you get to the value
4
Q
What does the acronym FIFO mean?
A
First in First Out
5
Q
What methods are available on a Queue data structure?
A
enqueue and dequeue (most important ones)
6
Q
What must you do to access the value at an arbitrary point in a queue (not just the “front”)?
A
Dequeue -> Peek -> Enqueue
7
Q
How are linked lists different from an array?
A
You can access an array by the index
8
Q
How would you access an arbitrary node in a linked list (not just the “head”)?
A
list.next
