Data structures has always been the critical part in all aspects of computer science from algorithms to data science the understanding of data structures is most important. This repository is mainly for ticking off one data structure at a time from my to-do list. Relevant notes for each data structure can be found Here. Most of the notes and test cases for each data structure is inspired from William fisset and His tutorials.

1. Dynamic Array
2. Stack
3. Queue
4. Linked List
   1. Singly Linked List
   2. Doubly Linked List
5. Binary Heap
6. Union Find
7. Binary Search Tree
8. Fenwick Tree
   1. Fenwick Tree Range Query Point Update
   2. Fenwick Tree Range Update Point Query
9. Hash Table
   1. Hash Table Linear Probing
   2. Hash Table Quadratic Probing
   3. Hash Table Separate Chaining
10. Segment Tree
    1. Array Implementation
    2. Pointer Implementation
11. Binary Search Tree
    1. Binary Search Tree
    2. AVL Tree
    3. Red-Black Tree
12. Trie