ℹ️ Skipped - page is already crawled
| Filter | Status | Condition | Details |
|---|---|---|---|
| HTTP status | PASS | download_http_code = 200 | HTTP 200 |
| Age cutoff | PASS | download_stamp > now() - 6 MONTH | 0.1 months ago |
| History drop | PASS | isNull(history_drop_reason) | No drop reason |
| Spam/ban | PASS | fh_dont_index != 1 AND ml_spam_score = 0 | ml_spam_score=0 |
| Canonical | PASS | meta_canonical IS NULL OR = '' OR = src_unparsed | Not set |
| Property | Value |
|---|---|
| URL | https://www.educba.com/c-plus-plus-queue/ |
| Last Crawled | 2026-04-04 17:13:17 (3 days ago) |
| First Indexed | 2020-02-08 12:53:33 (6 years ago) |
| HTTP Status Code | 200 |
| Meta Title | C++ Queue | How does Queue Work in C++ | Function and Parameters |
| Meta Description | Guide to C++ Queue. Here we discuss the Introduction and How does Queue work in C++ along with Function and its Parameter. |
| Meta Canonical | null |
| Boilerpipe Text | Updated March 23, 2023
Introduction to C++ Queue
Queue in C++ is a type of data structure that is designed to work as a First In First Out (FIFO) data container. Data entered from one side of a queue is extracted from the other side of a queue in a FIFO manner. In C++, std:: queue class provides all queue related functionalities to programmers. In this article, how queues can be used in C++ is explained along with its syntax, member types, and available queue functions.
Syntax:
The syntax for C++ Queue is as below:
// Syntax for queue in C++
using namespace std;
queue<data_type>queue_name;
To use above syntax for queue in C++, it is important to include #include<queue> header file.
queue_name is the user-defined name of the queue.
data_type is the data type of all members of the queue.
How does Queue Work in C++?
Queue in C++ can be declared
using syntax explained above. For example “queue<int>roll_number“ declares queue named as roll_number with all integer members. The declared queue here will be worked as FIFO(First In First Out) means element entered first in the queue will be extracted first and element inserted last will be extracted last. std:: queue class in C++ also provides many useful in-built member functions for programmers to use with a queue.
As shown in below figure, if elements are inserted in the order of 1->2->3->4->5 in the queue then they are extracted from the queue in the order of first inserted element will be extracted first and then rest that is in the order of 1->2->3->4->5.
Please have a look at below sample code to understand how a queue works in C++.
Code:
// C++ program to understand queue container
// including required header files
#include <iostream>
#include <queue> // header file to use queue functionalities in C++
using namespace std;
int main()
{
// declaration of queue named queue_sample
queue<int> queue_sample;
// inserting element in the queue container
queue_sample.push(1);
queue_sample.push(2);
queue_sample.push(3);
queue_sample.push(4);
queue_sample.push(5);
// Removing/Extracting the content from the queue container
while (!queue_sample.empty()) {
cout << ' ' << queue_sample.front();
queue_sample.pop();
}
return 0;
}
Output:
C++ Queue Member Types
Following are the details about C++ queue member types:
container_type:
container_type is the member type that provides a type of underlying container which is to be adapted by the queue.
size_type:
size_type is an unsigned integer which will show the number of elements in the queue.
value_type:
value_type is a type that represents the type of elements stored in the queue container.
Functions of C++ Queue
The following are different C++ queue functions which are mentioned along with an explanation of each function.
1. queue::empty()
This function is used to check whether a queue is empty or filled.
Parameter:
There is no parameter value which needs to be provided to this function.
Return value
: The return value of the function = true if the queue is empty with no element inside it. The return value of the function = false if the queue is non-empty.
2. queue::size()
This function is used to check the size or number of member elements of the queue.
Parameter:
There is no parameter value which needs to be provided to this function.
Return value
: This function returns size_type member type which is an unsigned integer type.
3. queue::front()
This function can be used to get details or references related to the front element of the queue. As the queue is First In First Out(FIFO) container, the front element is nothing but the oldest element present in the queue container.
Parameter
: There is no parameter value which needs to be provided to this function.
Return value
: This function returns a reference to the front or first element of the queue container.
4. queue::back()
This function can be used to get details or references related to the last element of the queue. As the queue is the First In First Out(FIFO) container, the last element is nothing but the newest element present in the queue container.
Parameter
: There is no parameter value which needs to be provided to this function.
Return value
: This function returns a reference to the last or newest inserted element of the queue container.
5. queue::push(const value_type& value)
This function can be used to insert a new element in the queue. This function inserts a new element after its last inserted element. The process to insert a new element in the queue is called enqueue operation.
Parameter:
The parameter of this function is the value with which we want inserted element to be initialized. The member type value_type is a type of element inserted in the queue container.
Return value
: This function returns nothing.
6. queue::pop()
This function is used to remove an element from the queue container. The element removed by this function will be the oldest element available in the queue. Because of the removal of one oldest element, after using this function, the size of the queue will be reduced by one. The process to remove an element from the queue is also called a dequeue operation.
Parameter:
There is no parameter value which needs to be provided to this function.
Return value
: This function returns nothing.
7. queue::swap(queue& queue2)
This function is used to swap the contents of two queues. After swapping two queues contents, it may be possible that the size of the two queues may be different than it was initially before swapping content. The type of two queues must be of the same type to swap the content using the queue::swap() function.
Parameter:
The parameter of this function will be another queue container of a similar type.
Return value
: This function returns nothing.
8. queue::emplace(const value_type& value)
This function is used to insert new elements in the queue container. It adds a new element at the end of the queue container.
Parameter:
The parameter of this function will be value to be inserted at the end of the queue container.
Return value
: This function returns nothing.
Conclusion
In this article, a queue container is explained along with its declaration and usage in C++. Different useful inbuilt member functions available in C++ are also explained in this article which is helpful to programmers to use queue containers in a more efficient way.
Recommended Articles
This is a guide to C++ Queue. Here we discuss the Introduction and How does Queue work in C++ along with Function and its Parameter. You may also look at the following articles to learn more –
Leap Year Program in C++
Queue in Java
Queue in C#
Queue in Python |
| Markdown | [](https://www.educba.com/)
[EDUCBA](https://www.educba.com/)
MENUMENU
- [Explore](https://www.educba.com/explore/)
- [EDUCBA Pro](https://www.educba.com/educba-pro/)
- [PRO Bundles](https://www.educba.com/pro-bundles/)
- [All Courses](https://www.educba.com/educba-courses/)
- [All Specializations](https://www.educba.com/courses/)
- [Blog](https://www.educba.com/blog/)
- [Enterprise](https://www.educba.com/enterprise/)
- [Free Courses](https://www.educba.com/skillup-101free/)
- [All Courses](https://www.educba.com/educba-courses/)
- [All Specializations](https://www.educba.com/courses/)
- [Log in](https://www.educba.com/c-plus-plus-queue/)
- [Sign Up](https://www.educba.com/sign-up/)
[Home](https://www.educba.com/) [Software Development](https://www.educba.com/software-development/) [Software Development Tutorials](https://www.educba.com/software-development/software-development-tutorials/) [C ++ Programming Tutorial](https://www.educba.com/software-development/software-development-tutorials/c-plus-plus-programming-tutorial/) **C++ Queue**
# C++ Queue
Article by[Priya Pedamkar](https://www.educba.com/author/priya-pedamkar/)
Updated March 23, 2023
## Introduction to C++ Queue
Queue in C++ is a type of data structure that is designed to work as a First In First Out (FIFO) data container. Data entered from one side of a queue is extracted from the other side of a queue in a FIFO manner. In C++, std:: queue class provides all queue related functionalities to programmers. In this article, how queues can be used in C++ is explained along with its syntax, member types, and available queue functions.
[Watch our Demo Courses and Videos]()
Valuation, Hadoop, Excel, Mobile Apps, Web Development & many more.
**Syntax:**
The syntax for C++ Queue is as below:
```
// Syntax for queue in C++
using namespace std;
queue<data_type>queue_name;
```
To use above syntax for queue in C++, it is important to include \#include\<queue\> header file.
queue\_name is the user-defined name of the queue.
data\_type is the data type of all members of the queue.
### How does Queue Work in C++?
[Queue in C++ can be declared](https://www.educba.com/queue-in-c-plus-plus/) using syntax explained above. For example “queue\<int\>roll\_number“ declares queue named as roll\_number with all integer members. The declared queue here will be worked as FIFO(First In First Out) means element entered first in the queue will be extracted first and element inserted last will be extracted last. std:: queue class in C++ also provides many useful in-built member functions for programmers to use with a queue.
As shown in below figure, if elements are inserted in the order of 1-\>2-\>3-\>4-\>5 in the queue then they are extracted from the queue in the order of first inserted element will be extracted first and then rest that is in the order of 1-\>2-\>3-\>4-\>5.
Please have a look at below sample code to understand how a queue works in C++.
**Code:**
```
// C++ program to understand queue container
// including required header files
#include <iostream>
#include <queue> // header file to use queue functionalities in C++
using namespace std;
int main()
{
// declaration of queue named queue_sample
queue<int> queue_sample;
// inserting element in the queue container
queue_sample.push(1);
queue_sample.push(2);
queue_sample.push(3);
queue_sample.push(4);
queue_sample.push(5);
// Removing/Extracting the content from the queue container
while (!queue_sample.empty()) {
cout << ' ' << queue_sample.front();
queue_sample.pop();
}
return 0;
}
```
**Output:**
### C++ Queue Member Types
Following are the details about C++ queue member types:
- **container\_type:** container\_type is the member type that provides a type of underlying container which is to be adapted by the queue.
- **size\_type:** size\_type is an unsigned integer which will show the number of elements in the queue.
- **value\_type:** value\_type is a type that represents the type of elements stored in the queue container.
### Functions of C++ Queue
The following are different C++ queue functions which are mentioned along with an explanation of each function.
#### 1\. queue::empty()
This function is used to check whether a queue is empty or filled.
**Parameter:** There is no parameter value which needs to be provided to this function.
**Return value**: The return value of the function = true if the queue is empty with no element inside it. The return value of the function = false if the queue is non-empty.
#### 2\. queue::size()
This function is used to check the size or number of member elements of the queue.
**Parameter:** There is no parameter value which needs to be provided to this function.
**Return value**: This function returns size\_type member type which is an unsigned integer type.
#### 3\. queue::front()
This function can be used to get details or references related to the front element of the queue. As the queue is First In First Out(FIFO) container, the front element is nothing but the oldest element present in the queue container.
**Parameter**: There is no parameter value which needs to be provided to this function.
**Return value**: This function returns a reference to the front or first element of the queue container.
#### 4\. queue::back()
This function can be used to get details or references related to the last element of the queue. As the queue is the First In First Out(FIFO) container, the last element is nothing but the newest element present in the queue container.
**Parameter**: There is no parameter value which needs to be provided to this function.
**Return value**: This function returns a reference to the last or newest inserted element of the queue container.
#### 5\. queue::push(const value\_type& value)
This function can be used to insert a new element in the queue. This function inserts a new element after its last inserted element. The process to insert a new element in the queue is called enqueue operation.
**Parameter:** The parameter of this function is the value with which we want inserted element to be initialized. The member type value\_type is a type of element inserted in the queue container.
**Return value**: This function returns nothing.
#### 6\. queue::pop()
This function is used to remove an element from the queue container. The element removed by this function will be the oldest element available in the queue. Because of the removal of one oldest element, after using this function, the size of the queue will be reduced by one. The process to remove an element from the queue is also called a dequeue operation.
**Parameter:** There is no parameter value which needs to be provided to this function.
**Return value**: This function returns nothing.
#### 7\. queue::swap(queue& queue2)
This function is used to swap the contents of two queues. After swapping two queues contents, it may be possible that the size of the two queues may be different than it was initially before swapping content. The type of two queues must be of the same type to swap the content using the queue::swap() function.
**Parameter:** The parameter of this function will be another queue container of a similar type.
**Return value**: This function returns nothing.
#### 8\. queue::emplace(const value\_type& value)
This function is used to insert new elements in the queue container. It adds a new element at the end of the queue container.
**Parameter:** The parameter of this function will be value to be inserted at the end of the queue container.
**Return value**: This function returns nothing.
### Conclusion
In this article, a queue container is explained along with its declaration and usage in C++. Different useful inbuilt member functions available in C++ are also explained in this article which is helpful to programmers to use queue containers in a more efficient way.
### Recommended Articles
This is a guide to C++ Queue. Here we discuss the Introduction and How does Queue work in C++ along with Function and its Parameter. You may also look at the following articles to learn more –
1. [Leap Year Program in C++](https://www.educba.com/leap-year-program-in-c-plus-plus/)
2. [Queue in Java](https://www.educba.com/queue-in-java/)
3. [Queue in C\#](https://www.educba.com/queue-in-c-sharp/)
4. [Queue in Python](https://www.educba.com/queue-in-python/)
Primary Sidebar
Footer
###### Follow us\!
- [](https://www.facebook.com/educba.official)
[](https://x.com/EducbaBusiness)
[](https://in.linkedin.com/company/corporate-bridge-academy)
[](https://www.instagram.com/educba.official/)
- [](https://www.youtube.com/channel/UC1_jSu02VOW1pusqb2NF49g)
[](https://www.coursera.org/partners/educba/)
[](https://www.udemy.com/user/premananda-suna/)
###### APPS
[](https://play.google.com/store/apps/details?id=com.educba.www)
[](https://apps.apple.com/us/app/educba-learning-app/id1341654580)
###### Blog
- [Blog](https://www.educba.com/blog/?source=footer)
- [Free Tutorials](https://www.educba.com/tutorials/?source=footer)
- [About us](https://www.educba.com/about-us/?source=footer)
- [Contact us](https://www.educba.com/contact-us/?source=footer)
- [Log in](https://www.educba.com/login/?source=footer)
###### Courses
- [Enterprise Solutions](https://www.educba.com/enterprise/?source=footer)
- [Free Courses](https://www.educba.com/skillup-101free/?source=footer)
- [Explore Programs](https://www.educba.com/explore/?source=footer)
- [All Courses](https://www.educba.com/courses/?source=footer)
- [All in One Bundles](https://www.educba.com/all-in-one-bundles/?source=footer)
- [Sign up](https://www.educba.com/sign-up/?source=footer)
###### Email
- [\[email protected\]](https://www.educba.com/cdn-cgi/l/email-protection#31535d5e56715455445253501f525e5c)
ISO 10004:2018 & ISO 9001:2015 Certified
© 2026 - EDUCBA. ALL RIGHTS RESERVED. THE CERTIFICATION NAMES ARE THE TRADEMARKS OF THEIR RESPECTIVE OWNERS.
X
X
x
Loading . . .
X
Free Software Development Course
Web development, programming languages, Software testing & others
X
This website or its third-party tools use cookies, which are necessary to its functioning and required to achieve the purposes illustrated in the cookie policy. By closing this banner, scrolling this page, clicking a link or continuing to browse otherwise, you agree to our [Privacy Policy](https://www.educba.com/privacy-policy/?source=popup "Privacy Policy")
OK
EDUCBA Login
X
[🚀 Limited Time Offer\! - 🎁 ENROLL NOW](https://www.educba.com/all-in-one/)
[]() |
| Readable Markdown | Updated March 23, 2023
## Introduction to C++ Queue
Queue in C++ is a type of data structure that is designed to work as a First In First Out (FIFO) data container. Data entered from one side of a queue is extracted from the other side of a queue in a FIFO manner. In C++, std:: queue class provides all queue related functionalities to programmers. In this article, how queues can be used in C++ is explained along with its syntax, member types, and available queue functions.
**Syntax:**
The syntax for C++ Queue is as below:
```
// Syntax for queue in C++
using namespace std;
queue<data_type>queue_name;
```
To use above syntax for queue in C++, it is important to include \#include\<queue\> header file.
queue\_name is the user-defined name of the queue.
data\_type is the data type of all members of the queue.
### How does Queue Work in C++?
[Queue in C++ can be declared](https://www.educba.com/queue-in-c-plus-plus/) using syntax explained above. For example “queue\<int\>roll\_number“ declares queue named as roll\_number with all integer members. The declared queue here will be worked as FIFO(First In First Out) means element entered first in the queue will be extracted first and element inserted last will be extracted last. std:: queue class in C++ also provides many useful in-built member functions for programmers to use with a queue.
As shown in below figure, if elements are inserted in the order of 1-\>2-\>3-\>4-\>5 in the queue then they are extracted from the queue in the order of first inserted element will be extracted first and then rest that is in the order of 1-\>2-\>3-\>4-\>5.
Please have a look at below sample code to understand how a queue works in C++.
**Code:**
```
// C++ program to understand queue container
// including required header files
#include <iostream>
#include <queue> // header file to use queue functionalities in C++
using namespace std;
int main()
{
// declaration of queue named queue_sample
queue<int> queue_sample;
// inserting element in the queue container
queue_sample.push(1);
queue_sample.push(2);
queue_sample.push(3);
queue_sample.push(4);
queue_sample.push(5);
// Removing/Extracting the content from the queue container
while (!queue_sample.empty()) {
cout << ' ' << queue_sample.front();
queue_sample.pop();
}
return 0;
}
```
**Output:**
### C++ Queue Member Types
Following are the details about C++ queue member types:
- **container\_type:** container\_type is the member type that provides a type of underlying container which is to be adapted by the queue.
- **size\_type:** size\_type is an unsigned integer which will show the number of elements in the queue.
- **value\_type:** value\_type is a type that represents the type of elements stored in the queue container.
### Functions of C++ Queue
The following are different C++ queue functions which are mentioned along with an explanation of each function.
#### 1\. queue::empty()
This function is used to check whether a queue is empty or filled.
**Parameter:** There is no parameter value which needs to be provided to this function.
**Return value**: The return value of the function = true if the queue is empty with no element inside it. The return value of the function = false if the queue is non-empty.
#### 2\. queue::size()
This function is used to check the size or number of member elements of the queue.
**Parameter:** There is no parameter value which needs to be provided to this function.
**Return value**: This function returns size\_type member type which is an unsigned integer type.
#### 3\. queue::front()
This function can be used to get details or references related to the front element of the queue. As the queue is First In First Out(FIFO) container, the front element is nothing but the oldest element present in the queue container.
**Parameter**: There is no parameter value which needs to be provided to this function.
**Return value**: This function returns a reference to the front or first element of the queue container.
#### 4\. queue::back()
This function can be used to get details or references related to the last element of the queue. As the queue is the First In First Out(FIFO) container, the last element is nothing but the newest element present in the queue container.
**Parameter**: There is no parameter value which needs to be provided to this function.
**Return value**: This function returns a reference to the last or newest inserted element of the queue container.
#### 5\. queue::push(const value\_type& value)
This function can be used to insert a new element in the queue. This function inserts a new element after its last inserted element. The process to insert a new element in the queue is called enqueue operation.
**Parameter:** The parameter of this function is the value with which we want inserted element to be initialized. The member type value\_type is a type of element inserted in the queue container.
**Return value**: This function returns nothing.
#### 6\. queue::pop()
This function is used to remove an element from the queue container. The element removed by this function will be the oldest element available in the queue. Because of the removal of one oldest element, after using this function, the size of the queue will be reduced by one. The process to remove an element from the queue is also called a dequeue operation.
**Parameter:** There is no parameter value which needs to be provided to this function.
**Return value**: This function returns nothing.
#### 7\. queue::swap(queue& queue2)
This function is used to swap the contents of two queues. After swapping two queues contents, it may be possible that the size of the two queues may be different than it was initially before swapping content. The type of two queues must be of the same type to swap the content using the queue::swap() function.
**Parameter:** The parameter of this function will be another queue container of a similar type.
**Return value**: This function returns nothing.
#### 8\. queue::emplace(const value\_type& value)
This function is used to insert new elements in the queue container. It adds a new element at the end of the queue container.
**Parameter:** The parameter of this function will be value to be inserted at the end of the queue container.
**Return value**: This function returns nothing.
### Conclusion
In this article, a queue container is explained along with its declaration and usage in C++. Different useful inbuilt member functions available in C++ are also explained in this article which is helpful to programmers to use queue containers in a more efficient way.
### Recommended Articles
This is a guide to C++ Queue. Here we discuss the Introduction and How does Queue work in C++ along with Function and its Parameter. You may also look at the following articles to learn more –
1. [Leap Year Program in C++](https://www.educba.com/leap-year-program-in-c-plus-plus/)
2. [Queue in Java](https://www.educba.com/queue-in-java/)
3. [Queue in C\#](https://www.educba.com/queue-in-c-sharp/)
4. [Queue in Python](https://www.educba.com/queue-in-python/) |
| Shard | 148 (laksa) |
| Root Hash | 3186935955618038348 |
| Unparsed URL | com,educba!www,/c-plus-plus-queue/ s443 |