Repository files navigation

This repository covers the implementation of the most important algorithms and data structures.

This goes along withthese posts series that explain each implementation in details.

We are covering the following data structures.

1. Arrays: Built-in in most languages so not implemented here.Code |Details.
2. Linked Lists: each data node has a link to the next (and previous).Code |Details.
3. Queue: data flows in a "first-in, first-out" (FIFO) manner.Code |Details.
4. Stacks: data flows in a "last-in, first-out" (LIFO) manner.Code |Details.

1. 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
   1. Binary Trees: same as tree but only can have two children at most.Details
   2. Binary Search Trees (BST): same as binary tree, but the nodes value keep this orderleft < parent < rigth.Code |Details
   3. AVL Trees: Self-balanced BST to maximize look up time.Code |Details
   4. Red-Black Trees: Self-balanced BST more loose than AVL to maximize insertion speed.Code | Details
2. Maps: key-value store.
   1. Hash Maps: implements map using a hash function.Code |Details
   2. Tree Maps: implement map using a self-balanced BST. WIP
3. Graphs: datanodes that can have a connection oredge to zero or more adjacent nodes. Unlike trees, nodes can have multiple parents, loops.Code |Details