Question

Using C++ 11, Create the following function based on the criteria mentioned below:

node.hpp

            ○This will contain your ​node struct○value ​is type int

            ○next​ is type Node*

            ○(optional) ​prev​ is type Node*

nodeFunctions.hpp

          ○This will contain the headers for all the functions you need to display, add, and remove                nodes from your list

            ■displayList ­ displays the entire list from beginning to end. If no elements let the user       know the list is empty

            ■addValue ­ adds a node with the past value to the end of the list

        ■removeLast ­ removes last node of list. If no elements let the user know the list is            empty   

            ■destroyList ­ frees all dynamic memory

            ■Any helper functions you so desire

nodeFunctions.cpp

            ○This will have the implementation for the above functions

Each header must have include guards

All functions are voids

//The main function

#include <iostream>

#include "node.hpp"

#include "nodeFunctions.hpp"

void displayMenu();

int getInput();

int main()

{

Node *head = NULL;

Node *tail = NULL;

bool done = false;

int choice = 0;

int value;

while(done != true) {

displayMenu();

choice = getInput();

switch(choice) {

case 1:

displayList(head);

break;

case 2:

std::cout << "Enter value to add to list: ";

std::cin >> value;

addValue(head, value);

break;

case 3:

removeLast(head);

break;

case 4:

done = true;

break;

default:

std::cout << "Not a valid choice" << std::endl;

break;

}

}

destroyList(head);

}

void displayMenu() {

std::cout << "What would you like to do?" << std::endl;

std::cout << "1) Display list" << std::endl;

std::cout << "2) Add value" << std::endl;

std::cout << "3) Remove value" << std::endl;

std::cout << "4) Quit" << std::endl;

}

int getInput() {

int choice;

std::cout << "Choice: ";

std::cin >> choice;

return choice;

}

Answer 1

//node.h

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

//nodefunctions.cpp

#include"node.h"
#include<iostream>
using namespace std;

void displayList(Node*head){
   while(head){
       cout<<head->data<<" ";
       head = head->next;
   }
   cout<<"\n\n";
}

void addValue(Node*&head, int value){
   Node*newNode = new Node;
   newNode->data = value;
   newNode->next = NULL;
  
   if(head==NULL){
   head = newNode;
       return;
   }
   Node*current = head;
   while(current->next)current = current->next;
  
   current->next = newNode;
  
}

void removeLast(Node*&head){
   if(head==NULL)return;
  
   Node*current=head,*prev=head;
   if(head->next==NULL){
       delete current;
       head=NULL;
       return;
   }
  
   while(current->next){
       prev = current;
       current = current->next;
   }
   prev->next = current->next;
   delete(current);
}

void destroyList(Node*&head){
   Node* current = head;
   Node* next;
  
while (current != NULL)
{
next = current->next;
delete(current);
current = next;
}
head= NULL;
}

//main.cpp

#include <iostream>
#include "nodefunctions.cpp"

void displayMenu();

int getInput();

int main()

{

Node *head = NULL;

Node *tail = NULL;

bool done = false;

int choice = 0;

int value;

while(done != true) {

displayMenu();

choice = getInput();

switch(choice) {

case 1:

displayList(head);

break;

case 2:

std::cout << "Enter value to add to list: ";

std::cin >> value;

addValue(head, value);

break;

case 3:

removeLast(head);

break;

case 4:

done = true;

break;

default:

std::cout << "Not a valid choice" << std::endl;

break;

}

}

destroyList(head);

}

void displayMenu() {

std::cout << "What would you like to do?" << std::endl;

std::cout << "1) Display list" << std::endl;

std::cout << "2) Add value" << std::endl;

std::cout << "3) Remove value" << std::endl;

std::cout << "4) Quit" << std::endl;

}

int getInput() {

int choice;

std::cout << "Choice: ";

std::cin >> choice;

return choice;

}

//sample output