Data_structure_Project

---

• 1- List
  • 1.1: Vector
  • 1.2: Doubly Linked List (List)
• 2- Stack
  • 2.1: Array Implementation Stack
  • 2.2: Linked List Implementation Stack
• 3- Queue
  • 3.1: Array Implementation Queue
  • 3.2: Simple Linked List
  • 3.3: Sorted Linked List
  • 3.4: Circular Linked List
• 4- Tree
  • 4.1: Binary Tree
  • 4.2: AVL Tree
  • 4.3: Splay Tree
  • 4.4: Red-Black Tree
  • 4.5: AA-Tree
  • 4.6: ScapeGoat tree
  • 6.7: Treaps
  • 4.8: Tree Traversals
  • 4.9: B Tree
    • 4.9.1: B-Tree
    • 4.9.2: B+Tree
    • 4.9.3: B*Tree
    • 4.9.4: 2-3 Tree
    • 4.9.5: 2-3-4 Tree
  • 4.10: Set
  • 4.11: Map
• 5- Hash
  • 5.1: Hash Table Separate Chaining
  • 5.2: Hash Table Open Addressing
    • 5.2.1: Linear probing
    • 5.2.2: Quadratic probing
    • 5.2.3: Double hashing
  • 5.3: Perfect Hash Table
• 6- Heaps
  • 6.1: Binary Heap
    • 6.1.1: Minimum Binary Heap
    • 6.1.2: Maximum Binary Heap
  • 6.2: d-Heap
  • 6.3: Leftist Heap
  • 6.4: Skew Heap
  • 6.5: Binomial Queue
  • 6.6: Priority Queue
  • 6.7: Fibonacci Heap
  • 6.8: Pairing Heap
• 7- The Disjoint Set
  • 7.1: Disjoint Set
• 8- Graph
  • 8.1 Undirected Graph
    • 8.1.1: Adjacency List
    • 8.1.2: Adjacency matrix
    • 8.1.3: Incidence matrix
  • 8.2 Directed Graph
    • 8.2.1: Adjacency List
    • 8.2.2: Adjacency matrix
    • 8.2.3: Incidence matrix
• 9- Sorting
  • 9.1 Bubble Sort
  • 9.2 Selection Sort
  • 9.3 Insertion Sort
  • 9.4 Shell Sort
  • 9.5 Merge Sort
  • 9.6 Quick Sort
  • 9.7 Heap Sort
  • 9.8 Bucket Sort
  • 9.9 Radix sort

---