This directory contains implementations, explanations, and optimizations of various data structures, essential for developing efficient algorithms and solving specific problems.
The repository maintains a clear hierarchy, organizing different types of data structures into directories:
DataStructures
├── Linear
│ ├── Arrays
│ ├── LinkedLists
│ ├── Stacks
│ └── Queues
│
├── Trees
│ ├── BinaryTrees
│ ├── BinarySearchTrees
│ ├── AVLTrees
│ └── RedBlackTrees
│
├── Graphs
│ ├── DirectedGraphs
│ └── WeightedGraphs
│
├── HashBased
│ ├── HashTables
│ ├── HashMaps
│ └── HashSet
│
└── Specialized
├── Heaps
├── Trie
├── BloomFilter
└── SkipLists
The README.md
of each data structure will typically contain:
- Introduction
- Visualization
- Operations
- Variants
- Use Cases
- Best Practices
- References