Implementing common data structures in C (for added challenge :D)
- Hash Set -> Array of Linked Lists based implementation ✔
- Hash Map -> Array of Linked Lists based implementation ✔
- Binary Heap -> Array based implementation ✔
- Change binary heap implementaion to have dynamic array so that heap grows if needed. However amortized logarithmic complexity should be maintained in all operations. [WIP]
- Graph DS
- Segment Tree
- Fenwick Tree