This repository is not just an implement yet a learning process to fully understand the data structures.
In this reop, I implement some common and useful data structures. Do not expect the implementations to be perfect, but do expect to see code written in haste.
Reference:
DataStructures.jl AbstractTrees.jl
- Enthusiasm
- Clear Mind
- Linked List
- Stack
- Queue
- Deque
- Circular Deque
- Sparse Array
- Binary Tree
- Heap
- Minmax Heap
- Priority Queue
- Trie
- Union-find structure
- Hash Table - chaining
- Hash Table - open addressing
- Adjacency Matrix
- Adjacency List