saqlain2204 / c-algorithms

C Data Structures and Algorithms

This repository contains C programs that demonstrate the implementation of various data structures and algorithms. These implementations serve as educational resources and can be used as a reference for understanding the fundamental concepts of data structures and algorithms in C programming.

Table of Contents

1. Queue Implementation
2. Queue Implementation Using Array
3. Stack Implementation
4. Stack Implementation Using Array
5. Tree Implementation
6. Priority Queue Implementation

Queue Implementation

The implementation_of_queue.c file contains an implementation of a basic queue data structure using a linked list. The queue follows the First-In-First-Out (FIFO) principle. It includes functions for enqueueing (adding) and dequeuing (removing) elements from the queue, as well as checking if the queue is empty.

Usage

Compile the implementation_of_queue.c file using a C compiler and run the executable to interact with the queue data structure.

Queue Implementation Using Array

The implementation_of_queue_using_array.c file contains an implementation of a queue data structure using an array. Similar to the linked list-based queue, this implementation follows the FIFO principle and provides functions for enqueueing and dequeuing elements.

Usage

Compile the implementation_of_queue_using_array.c file using a C compiler and run the executable to interact with the queue data structure.

Stack Implementation

The implementation_of_stack.c file contains an implementation of a stack data structure using a linked list. A stack operates on the Last-In-First-Out (LIFO) principle and supports push (addition) and pop (removal) operations.

Usage

Compile the implementation_of_stack.c file using a C compiler and run the executable to interact with the queue data structure.

Stack Implementation Using Array

The implementation_of_stack_using_array.c file contains an implementation of a queue data structure using an array. Similar to the linked list-based queue, this implementation follows the FIFO principle and provides functions for enqueueing and dequeuing elements.

Usage

Compile the implementation_of_stack_using_array.c file using a C compiler and run the executable to interact with the queue data structure.

Tree Implementation

The implementation_of_trees.c file contains an implementation of a binary tree data structure. The program demonstrates basic tree operations, including creating a tree, inserting nodes, and performing depth-first traversal (in-order, pre-order, and post-order).

Usage

Compile the implementation_of_trees.c file using a C compiler and run the executable to interact with the queue data structure.

Priority Queue Implementation

The implementation_of_priority_queue.c contains a C program that implements a priority queue data structure. A priority queue is a data structure that allows elements to be inserted with an associated priority and supports retrieval based on the highest or lowest priority.s.

Usage

Compile the implementation_of_priority_queue.c file using a C compiler and run the executable to interact with the queue data structure.

Contributing

Feel free to contribute to this repository by adding more data structure implementations, improving existing code, or providing documentation updates. To contribute, follow these steps:

1. Fork the repository.
2. Create a branch for your feature or bug fix.
3. Make your changes.
4. Test thoroughly.
5. Commit your changes and push to your fork.
6. Create a pull request to the original repository.

Acknowledgments

Special thanks to the C programming community for their valuable contributions and insights into data structures and algorithms.

Happy coding!

c-algorithms's Issues

Adding a detailed README.md

Adding a detailed README.md

Handling Edge test cases

Auto Adding Contributors list to README.md