Language: c++ 1. Your Own Linked List Design your own linked list class to hold

Question

Language: c++

1. Your Own Linked List Design your own linked list class to hold a series of integers. The class should have member functions for appending, inserting, and deleting nodes. Don?t forget to add a destructor that destroys the list. Demonstrate the class with a driver program. 2. List Print Modify the linked list class you created in Programming Challenge 1 to add a print member function. The function should display all the values in the linked list. Test the class by starting with an empty list, adding some elements, and then printing the resulting list out.

Explanation / Answer

I have added displaylist() function in the following code for printing all the values in the linked list and i have covered all the member functions mentioned in first question.

#include <iostream>
using namespace std;

struct ListNode {
   float value;
   ListNode *next;
};
ListNode *head;

class LinkedList {
public:
   int insertNode(float num);
   int appendNode(float num);
   void deleteNode(float num);
   void destroyList();
   void displayList();
   LinkedList(void) {head = NULL;}
   ~LinkedList(void) {destroyList();}
};

int LinkedList::appendNode(float num)
{
   ListNode *newNode, *nodePtr = head;
   newNode = new ListNode;
   if(newNode == NULL) {
       cout << "Error allocating memory for new list member! ";
       return 1;
   }
   newNode->value = num;
   newNode->next = NULL;
   if(head == NULL) {
       cout << "List was empty - " << newNode->value;
       cout << " is part of list's first node. ";
       head = newNode;
   }
   else {
       while(nodePtr->next != NULL)
           nodePtr = nodePtr->next;
       nodePtr->next = newNode;
   }
   return 0;
}

int LinkedList::insertNode(float num)
{
   struct ListNode *newNode, *nodePtr = head, *prevNodePtr = NULL;

   newNode = new ListNode;
   if(newNode == NULL) {
       cout << "Error allocating memory for new list member! ";
       return 1;
   }
   newNode->value = num;
   newNode->next = NULL;
   if(head==NULL) {
       cout << "List was empty - " << newNode->value;
       cout << " is part of list's first node. ";
       head = newNode;
   }
   else {
       while((nodePtr != NULL) && (nodePtr->value < num)) {
           prevNodePtr = nodePtr;
           nodePtr = nodePtr->next;
       }
       if(prevNodePtr==NULL)
           newNode->next = head;
       else
           newNode->next = nodePtr; prevNodePtr->next = newNode;
   }
   return 0;
}

void LinkedList::deleteNode(float num)
{
   struct ListNode *nodePtr = head, *prevNodePtr = NULL;

   if(head==NULL) {
       cout << "The list was empty! ";
       return;
   }
   if(head->value == num) {
       head = nodePtr->next;
       delete [] nodePtr;
   }
   else {
       while((nodePtr!= NULL)&&(nodePtr->value != num)) {
           prevNodePtr = nodePtr;
           nodePtr = nodePtr->next;
       }
       if(nodePtr==NULL)
           cout << "The value " << num << " is not in this list! ";
       else {
           prevNodePtr->next = nodePtr->next;
           delete [] nodePtr;
       }
   }
}

void LinkedList::destroyList()
{
   struct ListNode *nodePtr = head, *nextNode = nodePtr;

   if(head==NULL) {
       cout << "The list is empty! ";
       return;
   }
   while (nodePtr != NULL) {
       nextNode = nodePtr->next;
       delete [] nodePtr;
       nodePtr = nextNode;
   }
}

void LinkedList::displayList()
{
   struct ListNode *nodePtr = head;
   if (nodePtr == NULL)
       cout << "The list is empty! ";
   else {
       while (nodePtr != NULL) {
           cout << nodePtr->value << endl;
           nodePtr = nodePtr->next;
       }
   }
}
  

int main()
{
   int num;
   char answer, choice;
   LinkedList temp;
   do {
       cout << "Please enter a value to put in the list --> ";
       cin >> num;
       temp.insertNode(num);
       cout << endl;
       cout << "Would you like to put another value into your list? ";
       cin >> answer;
   } while(toupper(answer)=='Y');

   cout << "I will now display your list! ";
   cout << endl;
   temp.displayList();
}

Related Questions

Navigate

• Browse (All)
• Browse L
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.