stack4.cpp

stack4.cpp

Go Back

// Link to challenge: https://www.w3resource.com/cpp-exercises/stack/index.php

#include <iostream>
#include <vector>

using namespace std;

class Stack{
    private:

        struct node{
            int data;
            node* next;
        };

        node* head = nullptr;

    public:

        Stack(){

        }

        // void insert_elements_reverse(std::vector<int> arr){
        //     for (int i = arr.size() - 1; i >= 0; i--){
        //         if (head == nullptr){
        //             head = new node{arr[i], nullptr};
        //         }
        //         else {
        //             head = new node{arr[i], head};
        //         }
        //     }
        // }

        void insert_elements(std::vector<int> arr){
            for (int i = 0; i < arr.size(); i++){
                if (head == nullptr){
                    head = new node{arr[i], nullptr};
                }
                else {
                    head = new node{arr[i], head};
                }
            }
        }

        void printReverse(){
            cout << "Stack Elements: ";
            for (node* i = head; i != nullptr; i = i -> next){
                cout << i -> data << " ";
            }
            cout << endl;
        }

        void print(){
            int count = 0;
            node* i = head;
            print(count, i);
        }

        void print(int count, node* i){
            if (count == 0){
                cout << "Stack Elements: ";
            }
            // BASE CASE
            if (i == nullptr){
                return;
            }
            // cout << "Test Read: " << i -> data << endl;
            print(++count, i -> next);
            cout << i -> data << " ";
            // cout << "Count: " + to_string(count) << endl;
            if (i == head){
                cout << endl;
            }
        }

        void remove_element(){
            node* tmp = head;
            head = head -> next;
            tmp -> next = nullptr;
            delete tmp;
        }
};

int main(){
    cout << "Test Data:" << endl;
    Stack s4;
    cout << "Input some elements onto the stack:" << endl;
    s4.insert_elements({0, 1, 5, 2, 4, 7});
    s4.print();
    cout << "Display the reverse elements of the stack:" << endl;
    s4.printReverse();
    // s4.printReverse();
    cout << "Remove two elements:" << endl;
    s4.remove_element();
    s4.remove_element();
    s4.printReverse();
    cout << "Input two more elements" << endl;
    s4.insert_elements({-1, 10});
    s4.printReverse();
    cout << "Display the reverse elements of the stack:" << endl;
    s4.print();

    return 0;
}

Console Output

Test Data:
Input some elements onto the stack:
Stack Elements: 0 1 5 2 4 7
Display the reverse elements of the stack:
Stack Elements: 7 4 2 5 1 0
Remove two elements:
Stack Elements: 2 5 1 0
Input two more elements
Stack Elements: 10 -1 2 5 1 0
Display the reverse elements of the stack:
Stack Elements: 0 1 5 2 -1 10

Go Back