🌟 ADTs Collection

A collection of Abstract Data Types (ADTs) implemented in pure C.
Flexible, efficient, and adaptable implementations of commonly used data structures, designed for reuse in various C projects.

---

📚 Features

• Binary Search Tree (BST)
• AVL Tree
• Treap
• Singly & Doubly Linked Lists
• Stacks (Static, Dynamic, Generic)
• Queue (Generic)

---

⚡ Highlights

• Modular Design: Easily extensible and modifiable structures.
• Flexibility: Doubly Linked List supports circular configurations.
• Performance-Oriented: Optimized for efficient data handling.

---

🚀 Getting Started

Clone the Repository

git clone https://github.com/voidashi/ADTs-Collection.git

Compilation

Use a C compiler (like gcc) to compile the source files:

gcc -o program your_source_file.c

Examples

Include usage examples for the data structures:

#include "linkedlist.h"
// Example usage of linked list

---

🤝 Contributing

Feel free to submit issues or pull requests to help improve this collection!

---

📄 License

This project is licensed under the MIT License.