📘 Data Structures in C

A complete, well-organized and documented collection of core and advanced data structures implemented in C, for both learning and interview preparation.

---

📦 Structure

Each data structure is implemented in its own folder with:

• *.c – Implementation file
• *.h – Header with declarations and structs
• main.c – Example/demo usage
• README.md – Description, operations, time/space complexities
• CMakeLists.txt – Optional build file (per folder)

---

📋 Table of Contents

1. Implemented Structures
2. Usage Guide
3. Build Instructions
4. Testing
5. Contributing
6. License

---

🏗️ Implemented Structures

🔹 Linear

• Arrays (static/dynamic)
• Singly Linked List
• Doubly Linked List
• Circular Linked List
• Stack (Array & Linked List)
• Queue (Array & Linked List)

🔹 Hashing

• Hash Tables (Chaining & Open Addressing)
• Set & Map via hashing

🔹 Trees

• Binary Tree
• Binary Search Tree
• AVL Tree
• Red-Black Tree
• Segment Tree
• B-Tree (Optional)
• Trie

🔹 Heaps

• Min Heap
• Max Heap
• Priority Queue (with Heap)

🔹 Graphs

• Adjacency List / Matrix
• BFS & DFS
• Dijkstra’s Algorithm
• Kruskal’s / Prim’s (MST)

🔹 Advanced

• Disjoint Set (Union-Find)
• Skip List
• K-D Tree
• Fenwick Tree (Binary Indexed Tree)
• Sparse Table

---

🚀 How to Use

Clone the repo:

git clone https://github.com/Murchoid/data-structures-c.git
cd data-structures-c

Compile and run (using Make or CMake):

cd singly_linked_list
make
./singly_linked_list

OR

mkdir build && cd build
cmake ..
make

✅ Testing Some folders include unit tests (using Check for C):

cd tests
make test

🤝 Contributing We welcome contributions:

New data structures

Edge case handling

Code clean-up

Documentation

🙌 Acknowledgments Inspired by CLRS and university-level DSA courses.

Big thanks to contributors and the open-source community.

✨ Happy Coding and Learning! ✨