Data Structures/Algorithms

Question 1

How would you examine items below the top of a stack?

Answer 1

stack.pop => stack.peek

Question 2

How would you find out how many items are in a stack?

Answer 2

Have a counter that increments until stack.peek() is undefined

Question 3

What happens to the order of values that are moved from one stack to another?

Answer 3

The order is reversed

Question 4

How can a stack be returned to it’s original state after examining its internal values?

Answer 4

push all values from other stack back into original stack

Question 5

How would you examine items after the front of a queue?

Answer 5

queue.dequeue then queue.peek