Scribd Logo
Upload

Welcome to Scribd!

  • Solution A

    Uploaded by

    max03080504
    3 views2 pages
    This C++ code defines a Stack class with push, pop, peek, and isEmpty methods. It uses the Stack class to reverse the order of elements popped from one stack and pushed to another stack. It takes in user input of operations and values, performs the operations on the first stack, then pushes the results to a second stack and finally prints the second stack contents in reverse order.

    Original Description:

    Original Title

    solution A

    Copyright

    © © All Rights Reserved

    Available Formats

    TXT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This C++ code defines a Stack class with push, pop, peek, and isEmpty methods. It uses the Stack class to reverse the order of elements popped from one stack and pushed to another stack. It takes in user input of operations and values, performs the operations on the first stack, then pushes the results to a second stack and finally prints the second stack contents in reverse order.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as txt, pdf, or txt
    3 views2 pages

    Solution A

    Uploaded by

    max03080504
    This C++ code defines a Stack class with push, pop, peek, and isEmpty methods. It uses the Stack class to reverse the order of elements popped from one stack and pushed to another stack. It takes in user input of operations and values, performs the operations on the first stack, then pushes the results to a second stack and finally prints the second stack contents in reverse order.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as txt, pdf, or txt
    of 2

    #include <iostream>

    using namespace std;

    class Stack {
    private:
    struct Node {
    int data;
    Node* next;

    Node(int data) : data(data), next(nullptr) {}


    };

    Node* top;

    public:
    Stack()
    : top(nullptr) {
    }

    ~Stack() {
    while (!isEmpty()) {
    pop();
    }
    }

    void push(int data) {


    Node* newNode = new Node(data);
    newNode->next = top;
    top = newNode;
    }

    void pop() {
    if (isEmpty()) {
    return;
    }
    Node* temp = top;
    top = top->next;
    delete temp;
    }

    int peek() {
    if (isEmpty()) {
    return -1;
    }
    return top->data;
    }

    bool isEmpty() { return top == nullptr; }


    };

    int main()
    {
    Stack stack;
    int n;
    cin >> n;
    char sign;
    int value;

    Stack ans;
    for (int i = 0; i < n; ++i){
    cin >> sign;
    if(sign == '+'){
    cin >> value;
    stack.push(value);
    }
    else{
    ans.push(stack.peek());
    stack.pop();
    }
    }

    Stack tmp;

    while (!ans.isEmpty()) {
    tmp.push(ans.peek());
    ans.pop();
    }

    while (!tmp.isEmpty()) {
    cout << tmp.peek() << "\n";
    tmp.pop();
    }

    return 0;
    }

    You might also like