-
Arrays
-
Linked Lists
- Singly Linked List
- Doubly Linked List
- Circular Linked List
-
Stacks
-
Queues
- Simple Queue
- Circular Queue
- Priority Queue
- Double-ended Queue (Deque)
-
Hash Tables
-
Trees
- Binary Trees
- Binary Search Trees
- AVL Trees (Self-Balancing Binary Search Trees)
- Red-Black Trees
- Segment Trees
- Fenwick Trees (Binary Indexed Trees)
- Tries (Prefix Trees)
- Heaps
- Binary Heap
- Binomial Heap
- Fibonacci Heap
- Graphs
- Directed Graphs
- Undirected Graphs
- Weighted Graphs
- Advanced Data Structures
- Disjoint Set (Union-Find)
- Sparse Tables
- Suffix Trees and Suffix Arrays
- B-Trees
- B+ Trees
- KD Trees
- Interval Trees
- Specialized Data Structures
- Bloom Filters
- LRU Cache Count-Min Sketch