Please enable JavaScript to use CodeHS

Data Structures in C++

View Syllabus Overview

Lesson 4.3 Stacks

Description

In this lesson, students learn about stacks, a linear data structure that follows the LIFO (Last In First Out) principle. Similar to the behavior of real-world stacks, such as a stack of plates or deck of cards, elements of a stack are both inserted and removed from the top of the stack.

Objective

Students will be able to:

  • declare an empty stack
  • add elements to a stack using the push() method
  • remove elements from a stack using pop() method
  • access the top value of a stack using the top() method
  • perform other basic stack operations including size() and empty()

Activities

These are all the activities included in the lesson

4.3.1 Stacks
4.3.2 Basic Stack
4.3.3 Stack Example: Reverse a String
4.3.4 Quiz: Stacks
4.3.5 Browser History
4.3.6 Error Checking