C++ - Stacks, Queues, Deque

Overview

Estimated time: 40–60 minutes

Work with LIFO and FIFO containers and the double-ended queue. Learn push/pop patterns and common operations.

Learning Objectives

• Use std::stack, std::queue adapters and std::deque container.

Examples

#include 
#include 
#include 
#include 
int main(){
  std::stack st; st.push(1); st.push(2); std::cout << st.top(); st.pop();
  std::queue q; q.push(1); q.push(2); std::cout << q.front(); q.pop();
  std::deque d; d.push_front(1); d.push_back(2);
}

Common Pitfalls

• Access patterns differ (stack: top, queue: front/back).