Skip to content

Courses
Tutorials
Practice
Contests

C++
Standard Template Library
STL Vector
STL List
STL Set
STL Map
STL Stack
STL Queue
STL Priority Queue
STL Interview Questions
STL Cheatsheet
C++ Templates
C++ Functors
C++ Iterators

How to Create a Stack of Set in C++?

How to Create a Stack of Deque in C++?

Last Updated : 11 Mar, 2024

Comments

Improve

Suggest changes

Like Article

Like

Report

In C++, the stack is a container in which new elements are added from one end (top) and removed from that end only whereas a deque (double-ended queue) are sequence container with the feature of expansion and contraction on both ends. In this article, we will learn how to create a stack of deque in C++.

Example:

Input: 
myDeque1 = 1, 2, 3, 4
myDeque2 = 5, 6, 7Output: 
Stack of Deque: [ {5, 6, 7},
                  {1, 2, 3, 4} ]

Stack of Deque in C++

To create a stack of deques in C++, we need to pass the std::deque as the template parameter in the declaration of the stack. We can then use the std::stack::push() function to insert the deque container in the stack.

Syntax to Create a Stack of Deque in C++

stack<deque<datatype>> stack_name;

Here,

datatype denotes the type of data stored in the deque.
stack_name is the name of the stack of deque.

C++ Program to Use a Stack with a Deque

The below program demonstrates how we can create a stack of deque in C++.

C++

// C++ Program to illustrate how to crate a stack of deque #include <deque> #include <iostream> #include <stack> using namespace std;  int main() {     // Creating a stack of deques     stack<deque<int> > stackOfDeques;      // Pushing deques into the main stack (stackOfDeques)     deque<int> d1, d2;     d1.push_back(1);     d1.push_back(2);     d1.push_back(3);     d1.push_back(4);     d2.push_back(5);     d2.push_back(6);     d2.push_back(7);      // push the deque in stack of deques     stackOfDeques.push(d1);     stackOfDeques.push(d2);      // Printing elements from the stack of deques     cout << "Elements in the Stack of Deque:" << endl;     while (!stackOfDeques.empty()) {         deque<int> currD = stackOfDeques.top();         stackOfDeques.pop();          while (!currD.empty()) {             cout << currD.back() << " ";             currD.pop_back();         }     }      return 0; }

Output

Elements in the Stack of Deque:  7 6 5 4 3 2 1

Time Complexity: O(N), here N is the total number of deque.
Auxiliary Space: O(N * M), where M is the average number of elements in the deque.

How to Create a Stack of Set in C++?

G

gauravggeeksforgeeks

Improve

Article Tags :

C++ Programs
C++
STL
cpp-stack
cpp-deque
CPP Examples

Practice Tags :

CPP
STL

Similar Reads

How to Create a Deque of Sets in C++?

In C++, a container called deque is a queue like container but allows for fast insertions and deletions at both ends. In this article, we will learn how to create a deque of sets in C++. Example: Input: mySet1 = {1, 4, 8, 9, 11} mySet2 = {1, 2, 3, 5, 7} Output: myDeque: [ {1, 4, 8, 9, 11}, {1, 2, 3,

How to Create a Deque of Vectors in C++?

In C++, deques are sequence containers similar to queues but unlike queues, deques allow the insertion and deletion of elements from both ends efficiently. Vectors are dynamic arrays that can resize themselves during the runtime. In this article, we will learn how to create a deque of vectors in C++

How to Create a Stack of Map in C++?

In C++, the std::stack is a container that follows the LIFO (Last In, First Out) rule, whereas std::map is an associative container that stores key-value pairs. In this article, we will learn how to create a stack of a map in C++. Example:Input: myMap = { {1: â€˜aâ€™}, {2: â€˜bâ€™}, {3: â€˜câ€™} }; myMap = { {4

How to Create a Stack of Set in C++?

In C++ STL, Stacks are a type of container adaptor with LIFO(Last In First Out) type of working, where a new element is added at one end (top) and an element is removed from that end only. Sets are a type of associative container in which each element is unique and in some sorted order. In this arti

How to Create a Deque of Maps in C++?

In C++, the Standard Template Library (STL) provides a container called deque that allows efficient insertion and deletion operations at both ends of the container. A map is an associative container that stores elements in key-value pairs.In this article, we will learn how to create a deque of maps

How to Create a Stack of Stack in C++?

In C++, the stack is a container that follows the LIFO (Last In, First Out) order in which the elements are inserted and removed from it. In this article, we will learn how to create a stack of a stack in C++. Example:Input:Elements in stack1= 1, 2, 3, 4Elements in stack2= 5, 6, 7Output:Elements in

How to Create a Stack of Queue in C++?

In C++, the std::stack is a container that follows the LIFO (Last In, First Out) rule, whereas std::queue is a container that follows the FIFO (First In, First Out) rule. In this article, we will learn how to create a stack of a queue in C++. Example: Input:myQueue = { a, b, c };myQueue = { d, e };O

How to Create a Stack of Lists in C++?

In C++, a list is a sequence container that allows dynamic insertion and deletion operations, whereas a stack is a data structure that follows last-in, first-out (LIFO). In this article, we will learn how to create a stack of lists in C++. Example: Input: list1 = { 1, 2, 3, 4 }list2 = { 5, 6, 7 }Out

How to Create a Stack of Pairs in C++?

In C++, Stacks are a type of container adaptor with LIFO(Last In First Out) type of working, where a new element is added at one end (top) and an element is removed from that end only. A pair is a simple container that stores data in a key and value format. In this article, we will learn how to crea

How to Create a Deque of Arrays in C++?

In C++, a deque (double-ended queue) is a data structure that allows insertion and deletion at both ends whereas arrays are fixed-size collections of elements. In this article, we will learn how to create a deque of arrays in C++ STL. Example: Input: myArray1 = {1, 4, 8, 9, 11} myArray2 = {1, 2, 3,

Corporate & Communications Address:

A-143, 7th Floor, Sovereign Corporate Tower, Sector- 136, Noida, Uttar Pradesh (201305)

Registered Address:

K 061, Tower K, Gulshan Vivante Apartment, Sector 137, Noida, Gautam Buddh Nagar, Uttar Pradesh, 201305

Advertise with us

Company
About Us
Legal
Privacy Policy
In Media
Contact Us
Advertise with us
GFG Corporate Solution
Placement Training Program

Languages
Python
Java
C++
PHP
GoLang
SQL
R Language
Android Tutorial
Tutorials Archive

DSA
Data Structures
Algorithms
DSA for Beginners
Basic DSA Problems
DSA Roadmap
Top 100 DSA Interview Problems
DSA Roadmap by Sandeep Jain
All Cheat Sheets

Data Science & ML
Data Science With Python
Data Science For Beginner
Machine Learning
ML Maths
Data Visualisation
Pandas
NumPy
NLP
Deep Learning

Web Technologies
HTML
CSS
JavaScript
TypeScript
ReactJS
NextJS
Bootstrap
Web Design

Python Tutorial
Python Programming Examples
Python Projects
Python Tkinter
Python Web Scraping
OpenCV Tutorial
Python Interview Question
Django

Computer Science
Operating Systems
Computer Network
Database Management System
Software Engineering
Digital Logic Design
Engineering Maths
Software Development
Software Testing

DevOps
Git
Linux
AWS
Docker
Kubernetes
Azure
GCP
DevOps Roadmap

System Design
High Level Design
Low Level Design
UML Diagrams
Interview Guide
Design Patterns
OOAD
System Design Bootcamp
Interview Questions

Inteview Preparation
Competitive Programming
Top DS or Algo for CP
Company-Wise Recruitment Process
Company-Wise Preparation
Aptitude Preparation
Puzzles

School Subjects
Mathematics
Physics
Chemistry
Biology
Social Science
English Grammar
Commerce
World GK

GeeksforGeeks Videos
DSA
Python
Java
C++
Web Development
Data Science
CS Subjects

@GeeksforGeeks, Sanchhaya Education Private Limited, All rights reserved

We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy

Improvement

Suggest Changes

Help us improve. Share your suggestions to enhance the article. Contribute your expertise and make a difference in the GeeksforGeeks portal.

geeksforgeeks-suggest-icon

Create Improvement

Enhance the article with your expertise. Contribute to the GeeksforGeeks community and help create better learning resources for all.

geeksforgeeks-improvement-icon

Suggest Changes

min 4 words, max Words Limit:1000

Thank You!

Your suggestions are valuable to us.

What kind of Experience do you want to share?

Interview Experiences

Admission Experiences

Career Journeys

Work Experiences

Campus Experiences

Competitive Exam Experiences