This repository contains examples and implementations related to the Data Structures lecture (BM214). The examples are organized by weeks, covering various topics such as linked lists, stacks, and queues.

1. Week 1: LinkedListExample

   • Description: This example focuses on the implementation of a linked list. It covers the basic structure and operations of a linked list.

2. Week 2: DoubleCircularLinkedListExample

   • Description: Explore the implementation of a double circular linked list in this example. This includes understanding the structure and operations associated with this type of linked list.

3. Week 3: StackExample

   • Description: This example introduces the concept of a stack and its implementation. It covers the fundamental operations of a stack, such as push and pop.

4. Week 4: KuyrukQueue

   • Description: Examples about structure and units.

1. Clone the Repository:

   git clone https://github.com/YourUsername/Data-Structures-BM214.git

2. Navigate to a Specific Example:

   cd Data-Structures-BM214/(1.hafta)LinkedListExample

3. Review the Code:

   • Open and review the code files to understand the implementation details.

If you have additional examples, improvements, or corrections for existing examples, your contributions are highly encouraged! Feel free to create an issue, submit a pull request, or share your insights to enhance the learning experience for everyone.

This repository is intended for educational purposes only. The examples provided are based on the Data Structures lecture at Duzce University. Ensure compliance with academic integrity policies and use the resources responsibly.