TheDataStructuresManual

This repository contains the most used and important Data Structures in an attempt to understand how they work in the memory.

---

Repository Index

Select a module category below to view the individual algorithms, memory configurations, and language implementations:

1. Linear Structures

• Arrays & Matrices
  • Arrays
  • Matrix
  • Sparse Matrix
• Linked Lists
  • Singly Linked List
  • Doubly Linked List
  • Circular Linked List
• Sequential Access
  • Stack
  • Queues (Simple, Circular, Priority, Deque)

2. Trees

• Binary & Self-Balancing Search Trees
  • Binary Tree
  • Binary Search Trees (BST)
  • AVL Trees
  • Red-Black Trees
• Heaps
  • Min Heap
  • Max Heap
• String & Range Query Structures
  • Segment Trees
  • Fenwick Trees (BIT)
  • Trie
  • Suffix Tree
• Multi-Dimensional & Multi-Way Trees
  • B-Tree / B+ Tree
  • KD Tree
  • Quad Tree
  • Octree
  • R-Tree

3. Graphs

• Digraph
• Adjacency Matrix
• Adjacency List
• Double Connected Edge List (DCEL)

4. Hash-Based

• Hash Table
• Hash Map
• Hash Set

5. Advanced & Specialized Structures

• Fibonacci Heap
• Van Emde Boas Tree
• Splay Tree
• Treap
• Suffix Array
• Cartesian Tree
• Interval Tree
• Persistent Data Structures