Question

Implement the stack queue data structure with a linked list implementation to get the given test code in driver.cpp to work properly:

driver.cpp code:

#include <iostream>
#include "stackLL.h"

using namespace std;

int main()
{
        /////////////Test code for stack ///////////////
        stackLL stk;

        stk.push(5);
        stk.push(13);
        stk.push(7);
        stk.push(3);
        stk.push(2);
        stk.push(11);

        cout << "Popping: " << stk.pop() << endl;
        cout << "Popping: " << stk.pop() << endl;

        stk.push(17);
        stk.push(19);
        stk.push(23);

        while( ! stk.empty() )
        {
                cout << "Popping: " << stk.pop() << endl;
        }
        
        // output order: 11,2,23,19,17,3,7,13,5

}

stackLL.h code

class stackLL
{
private:
        class node
        {
        public:
                //put what you need in here
        };

        node * top;

public:
        
        stackLL()
        {}

        ~stackLL()
        {}

        //return true if empty, false if not
        bool empty()
        {}

        //add item to top of stack
        void push(int x)
        {}

        //remove and return top item from stack
        int pop()
        {}

};

Also provide a big-Oh bound on the worst case run-time for that method in terms of the number of items ‘n’ contained in the data structure at the time of the method call.  Justify your bound in each case.

Thank you