Question

C++ ONLY -- LAB ASSIGNMENT DIFFICULT

We have to turn in two files - List.h and Lab5.cpp

What should the code for those two files look like?

INSTRUCTIONS AS FOLLOWS:

What Should This Program Do?

Linked List Class

• Design your own linked list class (List.h) to hold a series of strings.
• The linked list node should be implemented as a struct.
• The class should have member functions for appending, inserting, and deleting nodes.
• You should also have a display function that will traverse the list & display each node’s value.
• Don’t forget to add a destructor that destroys the list.

DRIVER – Lab5.cpp

Write a driver program (Lab5.cpp) that will do the following:

1. Create a linked list object
2. Call the linked list’s append function to append the following strings to your linked list. Afterwards, print to the screen to tell the user that you are inserting several strings to the list.
   1. “boogeyman”
   2. “ghost”
   3. “scarecrow”
   4. “witch”
   5. “zombie”
3. Now call the linked list’s display function to print the list.
4. Now call the linked list’s insert function to insert the “vampire” string in the correct sorted position. Print to the screen to tell the user that you are inserting “vampire” in to the list.
5. Now call the linked list’s display function again to print the list.
6. Now call the delete function to delete “ghost” from the list. Print to the screen to tell the user that you are deleting “ghost” from the list.
7. Last, call the linked list’s display function again to print the list.

Answer 1

PROGRAM :

List.h

#ifndef LIST_H
#define LIST_H
#include<string>
#include<iostream>
using namespace std;
struct Node
{
string data;
Node *next;
};

class List
{
public:
List();
void appending(string);
void inserting(string);
void deleting(string);
void print();
private:
Node * head;
Node * tail;
};
#endif

List.cpp implementation file

#include"List.h"

List::List()
{
head = NULL;
tail = NULL;
cout << "The linked list has been created." << endl;
}

void List::appending(string data)
{
Node *newNode = new Node();
newNode->data = data;
newNode->next = NULL;
if (head == NULL)
{
head = tail=newNode;
return;
}
tail->next = newNode;
tail = newNode;
}
void List::inserting(string data)
{
Node *newNode = new Node();
newNode->data = data;
newNode->next = NULL;
if (head == NULL)
{
head = tail = newNode;
return;
}
if (head->data > data)
{
newNode->next = head;
head = newNode;
}
if (tail->data < data)
{
tail->next = newNode;
tail = newNode;
}
Node *curr = head;
Node *prev = head;
while (curr != tail)
{
if (curr->data > data)
break;
prev = curr;
curr = curr->next;
}
prev->next = newNode;
newNode->next = curr;
}
void List::print()
{
Node *temp=head;
while (temp)
{
cout << temp->data << endl;
temp = temp->next;
}
}
void List::deleting(string data)
{
if (head == NULL)
{
return;
}
if (head->data == data)
{
Node *temp = head;
head = head->next;
delete temp;
}

Node *curr = head;
Node *prev = head;
while (curr != tail)
{
if (curr->data == data)
break;
prev = curr;
curr = curr->next;
}
prev->next = curr->next;
}

Lab5.cpp

#include"List.h"

int main()
{
List lst;
cout << "I am appending several strings to the list." << endl;
lst.appending("boogeyman");
lst.appending("ghost");
lst.appending("scarecrow");
lst.appending("witch");
lst.appending("zombie");
lst.print();
cout << "I am inserting vampire in the list." << endl;
lst.inserting("vampire");
lst.print();
cout << "I am deleting ghost from the list." << endl;
lst.deleting("ghost");
lst.print();
system("pause");
}

OUTPUT :