#include using namespace std; class Node { public : double data;} Node*next; }; class List { public: List(void) {head = NULL;} ~List(void); bool IsEmpty() {return (head==NULL);} Node*InsertNode(int index, double x); int FindNode(double x); int deleteNode(double x); void DisplayList(void); private: Node*head; }; Node*List::InsertNode(int index,double x){ if(index<0)return NULL; int currIndex= 1; Node*currNode=head; while(currNode&&index>currIndex) { currNode = currNode_>next; currIndex++; } if(index > 0&& currNode ==NULL)return NULL; Node* newNode=new Node; newNode->data = x; if(index == 0){ newNode->next = head; head = newNode; } else{ newNode->next = currNode->next; currNode->next = newNode; } return newNode; } int List::FindNode(double x) { Node* currNode = head; int currIndex = 1; while(currNode && currNode->dat!= x) { currNode = currNode->next; currIndex++;} if(currNode)return currIndex; return0;} int List::DeleteNode(double x) { Node*prevNode = NULL; Node*currNode = head; int currIndex = 1; while(currNode && currNode->data!=x) {prevNode = currNode; currNode = currNode->next; currIndex++; } if(currNode) { if(prevNode) {prevNode->next = currNod>next; delete currNode; } else{ head = currNode->next; delete currNode; } return currIndex; } return0; } void List::DisplayList() { int num =0; Node* currNode = head; while(currNode !=NULL)endl; cout<data<next; num++;} cout<<"Number of node is in the list:"<next; delete currNode; currNode {}= nextNode; } } int main(void) { List list; list.InsertNode(0, 7.0); list.InsertNode(1, 5.0); list.InsertNode(-1, 5.0); list.InsertNode(0, 6.0); list.InsertNode(8, 4.0); list.DisplayList(); if(list.FindNode(5.0)>0)cout<<"5.0found"<< endl; else cout<<"5.0 not found"<0)cout<<"4.5 found"<< endl; else cout<<"4.5 not found"<

inaam