Data Structures in C

Overview

This repository provides a detailed guide to essential data structures with:

• Theoretical insights.
• Mathematical interludes.
• Practical C implementations.

The notes cover Linked Lists, Stacks, Queues, and Expression Evaluations (Infix, Prefix, Postfix). It’s an excellent resource for both learning and interview preparation.

Repository Contents

1. DataStructureNotes-1.pdf:
   • A comprehensive document containing detailed explanations and examples.
2. Source Code:
   • Examples of various data structures implemented in C, including:
     • Linked Lists
     • Stacks
     • Queues
     • Expression Evaluation Algorithms

How to Use

1. Download or clone the repository:

   git clone https://github.com/arrhenius975/Data_Structures_in_C.git

2. Explore the DataStructureNotes-1.pdf for concepts and theoretical explanations.
3. Compile and run the provided C programs: for example: to run the code provided for linked list one can create a c source file named linked_list.c (for example) and run using the terminal as follows

   gcc linked_list.c -o linked_list
   ./linked_list

Prerequisites

• Basic knowledge of C programming.
• GCC or an equivalent C compiler installed.

Author

Zak GitHub: @arrhenius975
Dedicated to my life partner: @r0s3-V3lv3t

References

This work is based on:

• Introduction to Algorithms by Cormen et al.
• Data Structures Using C by Reema Thareja.
• Fundamentals of Data Structures in C by Horowitz et al.

License

This project is licensed under the MIT License.
See the LICENSE file for more details.