Data Structure 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
.pop()
.push()
.peek()
3
Q
What must you do to access the value at an arbitrary point in a stack (not just the “top”)?’
A
Use .pop() until you reach the value that you need and put the stack back to where it was
4
Q
How are linked lists different from an array?
A
o You can access items sequentially unlike arrays which can be accessed randomly
o They don’t have indexes
o They’re like nested objects
o Real arrays are continuous chunk of arrays, linked lists are spread out
5
Q
How would you access an arbitrary node in a linked list (not just the “head”)?
A
Keep using .next() until you reach the node you’re looking for
