Skip to main content

Problem Solving with Algorithms and Data Structures using C++ The PreTeXt Interactive Edition

Section 3.5 Using a Stack in C++

Now that we have clearly defined the stack as an abstract data type we will turn our attention to using a stack with the help of the Standard Template Library (STL) in C++. Recall that when we give an abstract data type a physical implementation we refer to the implementation as a data structure.
🔗
As we described in Chapter 1, in C++, as in any object-oriented programming language, the implementation of choice for an abstract data type such as a stack is the creation of a new class. The stack operations are implemented as methods. However, the STL already has a well written implementation of the Stack class.
🔗
The following stack implementation (Task 3.5.1.a) assumes that the end of the array will hold the top element of the stack. As the stack grows (as push operations occur), new items will be added on the end of the array. pop operations will manipulate that same end.
🔗

Exploration 3.5.1. Stack Implementation.

(a) C++ Implementation. 

//Tests the push, empty, size, pop, and top methods of the stack library.

#include <iostream>
#include <stack>    // Calling Stack from the STL

using namespace std;

int main() {
    stack<int> newStack;

    newStack.push(3); //Adds 3 to the stack
    newStack.push(8);
    newStack.push(15);

    // returns a boolean response depending on if the stack is empty or not
    cout << "Stack Empty? " << newStack.empty() << endl;

    // returns the size of the stack itself
    cout << "Stack Size: " << newStack.size() << endl;

    // returns the topmost element of the stack
    cout << "Top Element of the Stack: " << newStack.top() << endl;

    // removes the topmost element of the stack
    newStack.pop();

    cout << "Top Element of the Stack: " << newStack.top() << endl;

    cout << "Stack Size: " << newStack.size() << endl;

    return 0;
}
🔗

(b) Python Implementation.

🔗
🔗

Reading Questions Reading Questions

1.

Given the following sequence of stack operations, what is the top item on the stack when the sequence is complete?
🔗
stack<int> m;
m.push(5);
m.push(12);
m.pop();
m.push(27);
cout << m.top();
  • Remember that a stack is built from the bottom up.
  • 12
    🔗
  • pay attention to the line that says m.pop();.
  • 27
    🔗
  • Good job. This is correct because the 12 was poped of from the end and the 27 was pushed.
  • The stack is empty
    🔗
  • This would mean everyting is removed from the stack, when does that happen?
🔗

2.

Given the following sequence of stack operations, what is the top item on the stack when the sequence is complete?
🔗
stack<int> m;
m.push(37);
m.push(56);
m.push(4);
while (!m.empty()){
    m.pop();
    m.pop();
}
  • 37
    🔗
  • You may want to check out the docs for
  • the stack is empty
    🔗
  • There is an odd number of things on the stack but each time through the loop 2 things are popped.
  • an error will occur
    🔗
  • Good Job, this is true because the stack can not evenly pop off every item within itself, because there is an odd number of items.
  • You may want to check out the docs for isEmpty
🔗
🔗
🔗
PrevTopNext