Stack

• LIFO
• push to top of stack, pop from top of stack
• top to get top of stack
• implement using array
  • if pop empty, then stack underflow. if push full, stack overflow.
  • to check if empty in O(1), check if top is e.g. 0.