Question

C++
Write an implementation of the ADT stack that uses a resizable array (vector class of C++ STL) to represent the stack items. Anytime the stack becomes full, double the size of the array. Maintain the stack’s bottom entry at the beginning of the array the same way we did in array-based implementation.

Answer 1

ANSWER:

GIVEN THAT:

#include <iostream>
#include <vector>

using namespace std;

class Stack {
private:
   vector<int> vec;
public:
   void push(int n) {
      vec.push_back(n);
   }
   
   int pop() {
      int n = vec[vec.size()-1];
      vec.pop_back();
      return n;
   }
   
   int top() {
      return vec[vec.size()-1];
   }
   
   bool isEmpty() {
      return vec.empty();
   }
   
   int size() {
      return vec.size();
   }
};

int main() {
   Stack s;
   for(int i = 0; i < 5; ++i) {
      s.push(i);
   }
   cout << "Stack contains" << endl;
   while(!s.isEmpty()) {
      cout << s.pop() << endl;
   }
   return 0;
}