Single Linked List

Abstract

---

• Used as
  1. Stack - O(1) to add/remove from the tail of the Linked List
  2. Queue (FIFO) - O(1) to add/remove from the head of the Linked List
  3. Hash Map - Separate Chaining to handle Hash Collision
  4. Graph - Each node has pointer(s) that link to other node(s)