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

.push() .pop() .peek()

Question 3

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

Answer 3

Keep popping the top of the stack until you get to the desired point

Question 4

What does the acronym FIFO mean?

Answer 4

First In First Out

Question 5

What methods are available on a Queue data structure?

Answer 5

.dequeue() .enqueue() .peek()

Question 6

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

Answer 6

You dequeue the front of the queue until you get to the desired point

Question 7

How are linked lists different from an array?

Answer 7

Nodes cannot be accessed by index

Question 8

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

Answer 8

You need to keep calling .next on the list until you get the node you want