C++ Data Structures

• Table of Contents
  • Linear Data Structure
    • Physical
      • Array
      • Linked List
    • Stack Array Based Implementation
    • Stack LinkedList Based Implementation
    • Queue
      • Types of Queue:
        • Circular Queue
        • Priority Queue
        • Deque
    • HashTable
      • Collision resolution by Open Addressing
      • Hash function using multiplication method
        h(k) = ⌊m(kA mod 1)⌋
A is any constant. The value of A lies between 0 and 1.
        But, an optimal choice will be ≈ (√5-1)/2 suggested by Knuth.
  • Non-Linear Data Structure
    • Trees
      • Heap
        • MIN-Heap
        • MAX-Heap
      • Binary Search tree
      • AVL Tree
    • Graph