data-structures

Question 1

What does the acronym LIFO mean?

Answer 1

last in first out

Question 2

What methods are available on a Stack data structure?

Answer 2

pop, push, peek,

Question 3

What must you do to access the value at an arbitrary point in a stack (not just the “top”)?

Answer 3

use the pop method which is destructive til you get to the value you want. if you don’t want to mutate it you would need to pop and save it to a variable get the value you want and push the popped values back in the stack.

Question 4

What does the acronym FIFO mean?

Question 5

What methods are available on a Queue data structure?

Question 6

What must you do to access the value at an arbitrary point in a queue (not just the “front”)?

Question 7

How are linked lists different from an array?

Answer 7

Linked lists are sequential access not random access

Question 8

How would you access an arbitrary node in a linked list (not just the “head”)?