Chapter 3
Stacks

3.1 Specification

A special case of lists in which restrictions are placed on where insertions and deletions can take place.

AbstractDataType Stack{ 
  instances 
     linear list of element, with top and bottom elements 
  operations 
    Create() 
    IsEmpty() 
    IsFull() 
    Top() 
    Add(x) 
    Delete() 
} 

3.2 Array Representation

• Insert and delete in O(1) time.

3.3 One-way Linked Representation

• Insert and delete in O(1) time
• No advantage to double-linked representation.