#include

#include "NumberList.h"

using namespace std;

class NumberList

{

private://Declae a structure for the list

struct ListNode

{

double value; //the value in this node

ListNode *next; //to point to the next node

};

ListNode *head; //List Head pointer

public: //constructor

NumberList()

{head = nullptr; }

int main()

{

NumberList list;

float values;

{

cout

cin >> NumberList;

}

void NumberList::appendNode(double num);

ListNode *newNode;

ListNode *nodePtr;

newNode = new ListNode;

newNode->values = num;

newNode->next = nullptr;

}

if (!head)

head = newNode;

else

{nodePtr = head;

while (nodePtr->next)

nodePtr = nodePtr->next;

nodePtr-> = newNode;

}

}

//***************************************************************************************************

// * *N E X T* * *

// *

//***************************************************************************************************

void NumberList::insertNode(double num)

{

ListNode *newNode;

ListNode *nodePtr;

ListNode *previousNode = nullptr;

newNode = new ListNode;

newNode->value = num;

if (!head)

{

head = newNode;

newNode->next = nullptr;

}

else

{

nodePtr = head;

previousNode = nullptr;

while (nodePtr!= nullptr && nodePtr->value

{

previousNode = nodePtr;

nodePtr = nodePtr->next;

}

if (previousNode == nullptr)

{ head = newNode;

newNode->next = nodePtr;

}

else

{

previousNode->next = newNode;

newNode->next = nodePtr;

}

//***************************************************************************************************

// * *N E X T* * *

// *

//***************************************************************************************************

void NumberList::deleteNodes(double num) //deletes every node with the value num

{

ListNode *nodeptr; //Traverse the list

ListNode *previousNode = nullptr; //Point to the previous node

if (!head)

return;

//If the first node is the one

while (head)

{

if (head->values == num)

{

nodePtr = head->next;

delete head;

head = nodePtr;

}

else

break; //breaks out of the loop

}

//Find any other nodes that have "num" in their value members

nodePtr = head;

while (nodePtr)

{

if (nodePtr->value == num)

{

previousNode->next = nodePtr->next;

delete nodePtr;

nodePtr = previousNode->next;

}

else

{

previousNode = nodePtr;

nodePtr = nodePtr->next;

}

}

}

//***************************************************************************************************

// * *N E X T* * *

// *

//***************************************************************************************************

void main()

{

NumberList list;

unsigned int size;

float num;

cout

cin >> size;

while (size>0)

{

cout

cin >> num;

list.appendNode(num);

size--;

cout

}

cout

cin >> num;

list.deleteNodes(num);

cout

cout "

list.DisplayList();

}

This is what i have so far.. but its not running.

Instructions: Write a complete C++ program that will implement the function DeleteNodes. DeleteNodes will take in a number as an argument. It will remove EVERY node that has that number in its value member. It should use only 1 and only 1 loop (Within the deleteNodes definition). It should work without any nested oops or errors. It will work for any linked lists of any size and any set of nodes. Demonstrate that the DeleteNodes function works in a driver program Sample Run: How many numbers do you want to append 5 Input a number nput a number 2 Input a number nput a number 3 Input a number hat number do you want to delete? Linked List Contents -> 2 3 Press any key to cont 1 nue