This repository covers the implementation of the most important algorithms and data structures.
This goes along with these posts series that explain each implementation in details.
We are covering the following data structures.
- Arrays: Built-in in most languages so not implemented here. Code | Details.
- Linked Lists: each data node has a link to the next (and previous). Code | Details.
- Queue: data flows in a "first-in, first-out" (FIFO) manner. Code | Details.
- Stacks: data flows in a "last-in, first-out" (LIFO) manner. Code | Details.
- Trees: data nodes has zero or more adjacent nodes a.k.a. children. Each node can only have one parent node otherwise is a graph not a tree. Code | Details
- Red-Black Trees: Self-balanced BST more loose than AVL to maximize insertion speed. Code | Details