Question

You are now going to create a LinkedList class, that will work very similarly to the Stack class seen in the book (and used in the previous exercise). Then write new methods as follows:

add ( LinkedList::Link* l, int n ): will insert in the linked list, after link l, a chain of n new links. Each link will store an integer that will be set to receive, in order, a value starting from 0 until n-1. In the last link of the list always set the next pointer to be NULL in order to mark the end of the list.

print (): this method moves through the entire list printing out each integer value stored in the links. cleanup (): updated cleanup function that will automatically delete all links in the linked list, including the data stored on each link

Stack Class used:

#ifndef STACK_H
#define STACK_H

#include <iostream>

struct Stack {
   struct Link {
       void* data;
       Link* next;
      
       void initialize(void* dat, Link* nxt){
           data = dat;
           next = nxt;
       }
   }* head;
  
   void initialize(){
       head = 0;
   }
  
   void push(void* dat){
       Link* newLink = new Link;
       newLink->initialize(dat, head);
       head = newLink;
   }
  
   void* peek(){
       if (head == 0){
           std::cout << "Stack is empty";
       }
       return head->data;
   }
  
   void* pop(){
       if(head == 0)
           return 0;
      
       void* result = head->data;
       Link* oldHead = head;
       head = head->next;
       delete oldHead;
       return result;
   }
  
   void cleanup(){
       if (head == 0){
           std::cout << "Stack is empty";
       }
       else {
           std::cout << "Stack is not empty";
       }
   }
};
#endif