Queue Data Structure in C – Implementation, Types & Examples

Queue Data Structure in C

Queue ek important linear data structure hai jo FIFO (First In First Out) principle follow karta hai. Agar aap DSA roadmap for beginners follow kar rahe hain, to Queue samajhna bahut zaroori hai kyunki ye real-world scenarios aur programming dono me extensively use hota hai.

Queue ka concept bilkul real life queue jaisa hota hai — jaise bank ya ticket counter par line me jo pehle aata hai wahi pehle service paata hai. Isi concept ko programming me Queue ke roop me use kiya jata hai.

📌 What is Queue in Data Structure?

Queue ek ordered collection hai jahan insertion ek end se hota hai (rear) aur deletion doosre end se (front).

👉 Important terms:

• Front – jahan se element remove hota hai

• Rear – jahan element add hota hai

🧍 Real-Life Example

Line me khade log:

• Pehle aaya → pehle serve hua
  👉 Ye Queue ka concept hai

⚙️ Basic Operations of Queue

1. Enqueue

Queue me element add karna

2. Dequeue

Queue se element remove karna

3. Peek (Front)

Front element ko dekhna

4. isEmpty

Queue empty hai ya nahi check karna

5. isFull

Queue full hai ya nahi (array implementation me)

💡 Example (Step-by-Step)

Queue me elements add karte hain:

Enqueue: 10 → 20 → 30

Queue:
Front → 10, 20, 30 ← Rear

Ab Dequeue karein:
👉 10 remove hoga
👉 Phir 20

👉 Ye clearly FIFO principle show karta hai

💻 Queue Implementation in C (Array)

#include <stdio.h>

#define MAX 5

int queue[MAX], front = -1, rear = -1;

void enqueue(int x){

   if(rear == MAX-1){

       printf("Overflow\n");

   } else {

       if(front == -1) front = 0;

       queue[++rear] = x;

   }

}

void dequeue(){

   if(front == -1 || front > rear){

       printf("Underflow\n");

   } else {

       front++;

   }

}

👉 Ye basic array-based queue implementation hai

🔄 Types of Queue

1. Simple Queue

Basic FIFO structure

2. Circular Queue

Last position first se connect hoti hai

3. Priority Queue

Elements priority ke hisaab se remove hote hain

4. Deque (Double Ended Queue)

Insertion aur deletion dono ends se possible

📈 Time Complexity

Operation                     Complexity

Enqueue                        O(1)

Dequeue                        O(1)

Peek                              O(1)

👉 Queue efficient data structure hai

🎯 Applications of Queue

• CPU scheduling

• Printer queue

• BFS (Graph traversal)

• Task scheduling

• Buffer handling

⚡ Advantages

• Easy to implement

• Efficient operations

• Real-world modeling

❌ Disadvantages

• Array implementation me fixed size

• Overflow/Underflow problem

• Random access possible nahi

🔥 Queue vs Stack

Feature                                      Queue                                      Stack

Principle                                     FIFO                                         LIFO

Insertion                                     Rear                                          Top

Deletion                                      Front                                         Top

👉 Stack aur Queue dono important hain aur interviews me frequently pooche jate hain

💡 Common Mistakes

• Front/rear update galat karna

• Overflow condition ignore karna

• Circular queue samajhna skip karna

👉 Tip: Diagram bana ke samjho

🚀 How to Master Queue

1. Concept clear karo

2. Array + Linked List dono samjho

3. Circular queue practice karo

4. BFS problems solve karo

Agar aap Queue seekh rahe hain to ye topics bhi zaroor padhein:

• 👉 DSA Roadmap for Beginners in Hindi

• 👉 Stack in Data Structure

• 👉 Linked List in Data Structure

• 👉 Binary Search in Data Structure

• 👉 Recursion in C

👉 Ye sab topics milkar aapki DSA strong banate hain

🏁 Conclusion

Queue ek simple aur powerful data structure hai jo real-world aur programming problems dono me useful hai. Agar aap DSA roadmap follow kar rahe hain to Queue aapka next important step hai.

Regular practice aur clear concepts ke saath aap Queue ko easily master kar sakte hain aur coding interviews ke liye prepare ho sakte hain.

👉 Complete Roadmap:

https://sites.google.com/view/dsarop/

👉 Next Topic:  Tree

https://sites.google.com/view/dsarop/tree