This repository contains my implementations of common datastructures in C language.
This repository will include all structures to be covered in my college and some extra structures which may not be in the syllabus.
Eventually, some algorithms that use these data structures such as DFS, BFS, Dijkstra's, Huffman Encoding, Topological sort etc. may also be added.
The structures being implemented for this repository are:
- Linked List
- Singly Linked List ✔
- Doubly Linked List
- Circular Linked List
- Header Linked List
- Circular Doubly Linked List
- Self-organizing Linked List
- Stack ✔
- Array Representation ✔
- Linked Representation ✔
- Queue
- Deque
- Priority Queue (similar to heaps)
- Circular Queue
- Trees
- General Tree
- Binary Tree
- Binary Search Tree
- Threaded Binary Tree
- AVL Tree
- Red-Black Tree
- Huffman Tree
- Splay Tree
- B Tree
- B+ Tree
- 2-3 Tree
- Heaps
- Min Heap
- Max Heap
- Graphs
- Adjacency List
- Adjacency Matrix
- Hash Table
- Bloom Filters
- Union Find