Stacks

Overview

  • Last in first out (LIFO)
  • Basic operations: Enqueue, Dequeue, Peek
  • Can be implemented with a linked nodes, ¬†array, or two stacks.

Advantages

 

Disadvantages

 

Time Complexities

Leave a Comment