- Related Questions & Answers
- Operations on an Array in Data Structures
- Data Structures Stack Primitive Operations
- Difference between Stack and Queue Data Structures
- Meldable Priority Queue Operations
- Kernel Data Structures
- Kinetic Data Structures
- Abstract Data Type in Data Structures
- Correspondence Based Data Structures
- Data objects and Structures
- Inbuilt Data Structures in C#
- Inbuilt Data Structures in Python
- Tail Recursion in Data Structures
- Bernoulli Distribution in Data Structures
- Binomial Distribution in Data Structures
- Geometric Distribution in Data Structures

- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who

Queue is First In First Out data structure. The queue is used in different area for graph traversal algorithms Breadth First Search etc. The queue has some primitive operations. Here we will see those operations of queue, and see one example using the queue ADT.

The ADT (abstract datatype) is special kind of datatype, whose behavior is defined by a set of values and set of operations. The keyword “Abstract” is used as we can use these datatypes, we can perform different operations. But how those operations are working that is totally hidden from the user. The ADT is made of with primitive datatypes, but operation logics are hidden.

These are few operations or functions of the queue ADT.

- isFull(), This is used to check whether queue is full or not
- isEmpry(), This is used to check whether queue is empty or not
- enqueue(x), This is used to push x at the end of the queue
- delete(), This is used to delete one element from the front end of the
- front(), This is used to get the front most element of the queue
- size(), this function is used to get number of elements present into the queue

#include<iostream> #include<queue> using namespace std; main(){ queue<int> que; if(que.empty()){ cout << "Queue is empty" << endl; } else { cout << "Queue is not empty" << endl; } //insert elements into queue que.push(10); que.push(20); que.push(30); que.push(40); que.push(50); cout << "Size of the queue: " << que.size() << endl; //delete and dispay elements while(!que.empty()) { int item = que.front(); // read element from first position que.pop(); cout << item << " "; } }

Queue is empty Size of the queue: 5 10 20 30 40 50

Advertisements