Question

In C++

- Learn how to implement linked lists

Part 1 Node and Linked List Class (50 pts):
Create node with public properties: Block type block and block ptr next. Create a linked list class that uses the node you generated without an add or delete method with a head and optional tail and counter. Make a driver that generates a node to test your implementation.

Part 2 Add Method (30 pts):
Create an add method in your linked list class which will add nodes to the end of the list. Append to your driver function a way to test your add function.

Part 3 Find Method (10 pts)
Create a find method in linked list class that will find a node based on its id from the block, if the node is found return the block object, if not return NULL. Add code to your driver that checks for an existing node and a non-existing node.

Part 4 Delete Method (10 pts)
Create delete method, that will find and delete a node from the linked list. If the node is removed the method return 0, and if the node doesn't exist return -1. Add to your driver a few lines that checks the delete methods.

Answer 1

****This requires some effort so please drop a like if you are satisfied with the solution****

I have satisfied all the requirements of the question and I'm providing the screenshots of code and output for your reference...

Code:

#include<iostream>
#include<conio.h>
#include<stdlib.h>
using namespace std;
class Node
{
public:
int data;
Node* next;
};
class LinkedList:public Node
{

Node *head,*tail;
public:
LinkedList()
{
head=NULL;
tail=NULL;
}
void insert(int n);
void del(int n);
void display();
Node* search();
};
void LinkedList::insert(int n)
{
Node *temp;
temp=new Node;
temp->data=n;
temp->next=NULL;
if(head==NULL)
{
head=temp;
tail=head;
}

else
{
tail->next=temp;
tail=temp;
}
}
void LinkedList::del(int n)
{
Node *curr=head,*temp=head;
int flag=0;
if(temp==NULL)
{
cout<<"\nList is Empty";
}
else{
   while(temp!=NULL)
   {
   if(temp->data==n){
       if(temp==head){
           flag=1;
           head=temp->next;
           temp->next=NULL;
           break;
               }
               else{
                   flag=1;
                   curr->next=temp->next;
                   temp->next=NULL;
                   break;
               }
           }
           curr=temp;
   temp=temp->next;
   }
   }
   if(flag==0)
       cout<<"\nElement not found in list";
}
void LinkedList::display()
{
Node *temp=head;
if(temp==NULL)
{
cout<<"\nList is Empty";
}
while(temp!=NULL)
{
cout<<temp->data;
if(temp->next)
   cout<<"-->";
temp=temp->next;
}
cout<<endl;
}
Node* LinkedList::search()
{
int n,position=0;
int flag=0;
if(head==NULL)
{
cout<<"LinkedList is Empty";
return 0;
}
cout<<"\nEnter the Value to be Searched:";
cin>>n;
Node *temp;
temp=head;
while(temp!=NULL)
{
position++;
if(temp->data==n)
{
flag=1;
cout<<"Element "<<n<<" is Found at "<<position<<" Position"<<endl;;
return temp;
}
temp=temp->next;
}
if(flag==0)
{
return NULL;
}
}
int main()
{
LinkedList l;
Node *temp;
l.insert(2);
l.insert(5);
l.insert(99);
l.insert(10);
l.insert(23);
cout<<"List after insertion:"<<endl;
l.display();
if(l.search()==NULL)
{
   cout<<"\nElement not found in the list";
   }
   cout<<"\nDeleting 10 from list"<<endl;
   l.del(10);
   l.display();
   cout<<"\nDeleting 5 from list"<<endl;
   l.del(5);
   l.display();
return 0;
}

Output Screenshot:

F:AUntitled1.exe List after insertion: 2-->5--99- ->10- - >23 Enter the Value to be Searched: 5 Element 5 is Found at 2 Position Deleting 10 from list 2-->5-->99-- >23 Deleting 5 from list 2-->99-->23 Process exited after 1.784 seconds with return value 0 Press any key to continue

Code Screenshot:

#include<iostream> 1 #include<conio. h> 2 #include<stdlib.h> 3 using namespace std class Node 4 6E public: int data; Node* next; 7 8 9 10 class LinkedList: public Node 12日{ 11 13 Node head, *tail; 14 15 public: LinkedList() 17E head NULL tail-NULL } void insert( int n) void del(int n) void display ( ) Node search ( ) ; 18 19 20 21 22 23 24 25 void Linked List::insert ( int n) 27日{ 26 Node temp temp new Node; temp->data=n; 28 29 30 Resources Compile Log Debug Find Results Compiler Ln o NCO O

temp->next NULL; if ( head==NULL) 31 32 33 head-temp; tail-head; } 34 35 36 37 38 else 39E tail->next-temp tail-temp; } } void LinkedList: del (int n) 40 41 42 43 44 45日{ Node curr head, *temp=head; int flag 0; if (tempNULL) 46 47 48 49E cout<<"\nList is Empty"; } else while(temp!=NULL) 50 51 52 53 54 if (temp->data==n ) { if (temp== head){ flag 1; head-temp->next; temp->next NULL; break; 55 56 57 58 59 60 Resources dh Compile Loq Debug Find Results Compiler m m m m m m m m m t

61 else flag 1; 62E 63 64 curr->next-temp- >next; temp->next NULL; break; 65 66 67 68 69 curr temp temp temp->next; 70 71 72 if(flag=0) 73 74 cout<<"\nElement not found in list"; 75 void LinkedList: :display ( 77日{ 76 Node temp head; if (tempNULL) 78 79 80E cout<<"\nList is Empty"; 81 82 while(temp!=NULL) 83 84 F cout<<temp->data; if(temp->next) cout<<""; 85 86 87 88 temp-temp->next; } cout<<endl; 89 90

91 L Node Linked List::search () 93E 92 int n,position=0; int flag 0; if ( head==NULL) 94 95 96 97E cout<<"LinkedList is Empty"; return 0 } cout<<"\nEnter the Value to be Searched: "; cin>>n; Node temp temp-head; while(temp! NULL) 98 99 100 101 102 103 104 105 106E position++ if (temp - >data==n) 107 108 109E 110 111 112 flag 1; cout<<"Element "<n<<" is Found at "<< position< < " Position"<<endl; ; return temp; 113 114 115 116 117 E 118 119 120 temp temp->next; } if (flag=0) return NULL ;

temp temp->next } if (flag=0) 114 115 116 117E return NULL; 118 119 120 int main) 121 122E LinkedList 1; Node temp 1.insert (2); 1.insert (5) 1.insert(99); 1.insert(10); 1.insert (23) cout<<"List after insertion : "<<endl ;| 1.display() if (1.search() = =NULL) 123 124 125 126 127 128 129 130 131 132 133 E 134 cout<"\nElement not found in the list"; 135 cout<<"\nDeleting 10 from list"<<endl 1.del(10) 1.display() cout<<"\nDeleting 5 from list"<<endl; 1.del(5) 1.display() return 0 } 136 137 138 139 140 141 142 143