1. Title

Data-Structures-Learning

---

2. Description

This repository contains C programs demonstrating the implementation of fundamental data structures.

3. Structure of the Repository

1. Linear Data Structures

• Arrays
  1. Traversal
  2. Insertion
  3. Deletion
  4. Searching (Linear)
  5. Sorting (Bubble Sort)
• Linked Lists
  1. Singly Linked List
     1. Traversal (Forward)
     2. Insertion (Beginning, End, Specific Position)
     3. Deletion (Beginning, End, Specific Position)
     4. Searching
     5. Counting Nodes
  2. Doubly Linked List
     1. Traversal (Forward, Backward)
     2. Insertion (Beginning, End, Specific Position)
     3. Deletion (Beginning, End, Specific Position)
     4. Searching
     5. Counting Nodes
  3. Circular Singly Linked List
     1. Traversal (Forward)
     2. Insertion (Beginning, End, Specific Position)
     3. Deletion (Beginning, End, Specific Position)
     4. Searching
     5. Counting Nodes
  4. Circular Doubly Linked List
     1. Traversal (Forward, Backward)
     2. Insertion (Beginning, End, Specific Position)
     3. Deletion (Beginning, End, Specific Position)
     4. Searching
     5. Counting Nodes
• Stacks
  1. push(x)
  2. pop()
  3. top()/peek()
  4. isEmpty()
  5. isFull()
• Queues
  1. enqueue(x)
  2. dequeue()
  3. front()/peek()
  4. isEmpty()
  5. isFull()