Data Structures & Algorithms

Question 1

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

Answer 1

use stack.pop( ) to remove the top element from a stack

Question 2

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

Answer 2

Use a counter, add one to the counter while stack.peek( ) !== undefined

Question 3

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

Answer 3

The order of the values is reversed.

Question 4

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

Answer 4

By pushing the values of the inverted stack back onto the original stack