Queues are an abstract data type, specifically designed to operate in a FIFO context (first-in-first-out). The elements are inserted into one end of the container and extracted from the other. They are a type of container adaptor in the C++ Standard Library. The queue::push()
is a method available in the STL which inserts a new element at the end of the queue.
Syntax:
queue_name.push(val);
Parameters: The queue::push()
method accepts a single parameter:
• Value that has to be inserted
Return type: none
Example of queue::push() method
#include <iostream> #include <queue> using namespace std; int main () { queue<int> q; for(int i = 1; i <= 5; i++) q.push(i); while (!q.empty()) { cout<<q.front()<<" "; q.pop(); } return 0; }
Output:
1 2 3 4 5