Question

Build a singly linked list with 10 noes. The data are "This is my first project in Data structure and algorithm". First node is "This" second "is" and so on. Build insert function, insert "the " before "Data" and delete function, delete "my" before "first". Search "in" and output it location and then append "C++" and output the linked list again. In writing this program use menu which includes ”1. Create; 2. Insert; 3. Delete; 4. Append; 5. Search; 6. Quit”.

Answer 1

Screenshot of code:

main.cpp 1 #include<bits/stdc++.h> 2 using namespace std; 3 typedef long long 11; 4 struct node 5 { string s; node next; 8 }; 9 node create(string str) 18 { 11 node t=new node; t->s=str; t->next=NULL; 14 return t; 15 } 16 node append(node head, string str) 17 { 18 nodeh-head; if(h==NULL) return create(str); while(h->next!=NULL) h=h->next; h->next=create(str); return head; 26 node insert(node head, string str, string tar) nodeh-head; if(h->Setar) node t=create(str); t->next=h; return t; while(h->next-><!tar) h=h->next; node t=create(str); node tmp=h->next; h->next=t; t->next=tmp; return head; 42 } 43 node del(node head, string str,string tar)

44 { nodeh-head; if(h-S==strah->next->s==tar) nodet=h->next; free(head); return t; while((h->next->5!=str)||(h->next->next->s!tar)) h=h->next; node t-h->next; h->next=h->next->next; free(t); return head; 59 11 search(node head, string str) 60 { il c=1; node h=head; while(h!=NULL&&h-><!-str){ h=h->next; C++;} return c; 67 } void dis(node head) 69 { nodeh-head; while(h!=NULL) 68 cout<<h->s«""; h=h->next; cout<<"\n"; 78 int main() 79. { 80 11 ch; string str,s1; node head=NULL; while(1)

2:to insertin 3: to Delete\n 4:to append\n 5: to Search\n 6:to Quuit\n 7: to display list\n"; cout<<"Enter 1: to create\n cin>>ch; if(ch==1) cout<<"Enter string: "; cinstr; create(str); else if(ch==2) cout<<"Enter source and destination string: "; cin>>str>>s1; head=insert(head, str,s1); else if(ch==3) 102 183 184 cout<<"Enter source and destination string: "; cinstr>>s1; head=del (head, str,s1); 1e5 else if(ch=-4) 106 107 1e8 cout<<"Enter string: "; cin>>str; head=append(head, str); 109 110 else if(ch==5) cout<<"Enter string :"; cin>>str; 11 indx=search(head,str); cout<<str<<" is present at position "<<indx<<endl; 118 119 120 else if(ch==7) dis(head); else break; 121 122 123 }
output:

Enter 1: to create 2:to insert 3:to Delete 4:to append 5:to Search 6: to Quuit 7: to display list Enter string: This Enter 1: to create 2:to insert 3:to Delete 4:to append 5:to Search 6:to Quuit 7: to display list Enter string: is Enter 1:to create 2:to insert 3:to Delete 4:to append 5:to Search 6:to Quuit 7: to display list Enter string: my Enter 1: to create 2:to insert 3:to Delete 4:to append 5:to Search 6:to Quuit 7: to display list Enter string: first Enter 1:to create 2:to insert 3:to Delete 4:to append 5:to Search 6:to Quuit 7: to display list

Enter string: project Enter 1: to create 2:to insert 3:to Delete 4:to append 5:to Search 6:to Quuit 7: to display list Enter string: in Enter 1: to create 2:to insert 3:to Delete 4:to append 5:to Search 6:to Quuit 7: to display list Enter string: Data Enter 1: to create 2:to insert 3:to Delete 4:to append 5:to Search 6:to Quuit 7: to display list Enter string: structure Enter 1: to create 2:to insert 3:to Delete 4:to append 5:to Search 6:to Quuit 7: to display list Enter strings and Enter 1:to create 2:to insert 3:to Delete 4:to append

4. to appena 5:to Search 6:to Quuit 7: to display list Enter string: algorithm Enter 1: to create 2:to insert 3:to Delete 4:to append 5:to Search 6:to Quuit 7: to display list This is my first project in Data structure and algorithm Enter 1: to create 2:to insert 3:to Delete 4:to append 5:to Search 6:to Quuit 7: to display list Enter source and destination string: the Data Enter 1: to create 2:to insert 3:to Delete 4:to append 5:to Search 6:to Quuit 7: to display list This is my first project in the Data structure and algorithm Enter 1: to create 2:to insert 3:to Delete 4:to append 5:to Search 6:to Quuit 7: to display list Enter source and destination string: my first

Enter 1: to create 2:to insert 3:to Delete 4:to append 5:to Search 6:to Quuit 7: to display list This is first project in the Data structure and algorithm Enter 1: to create 2:to insert 3:to Delete 4:to append 5:to Search 6:to Quuit 7: to display list Enter string :in in is present at position 5 Enter 1: to create 2:to insert 3:to Delete 4:to append 5:to Search 6: to Quuit 7: to display list Enter string: C++ Enter 1: to create 2:to insert 3:to Delete 4:to append 5:to Search 6:to Quuit 7: to display list This is first project in the Data structure and algorithm C++ Enter 1: to create 2:to insert 3:to Delete 4:to append

code:

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
struct node
{
string s;
node* next;
};
node* create(string str)
{
node* t=new node;
t->s=str;
t->next=NULL;
return t;
}
node* append(node* head,string str)
{
node* h=head;
if(h==NULL)
return create(str);
while(h->next!=NULL)
h=h->next;
h->next=create(str);
return head;
}
node* insert(node* head,string str,string tar)
{
node* h=head;
if(h->s==tar)
{
node* t=create(str);
t->next=h;
return t;
}
while(h->next->s!=tar)
h=h->next;
node* t=create(str);
node* tmp=h->next;
h->next=t;
t->next=tmp;
return head;
}
node* del(node* head,string str,string tar)
{
node* h=head;
if(h->s==str&&h->next->s==tar)
{
node* t=h->next;
free(head);
return t;
}
while((h->next->s!=str)||(h->next->next->s!=tar))
h=h->next;
node* t=h->next;
h->next=h->next->next;
free(t);
return head;
}
ll search(node* head,string str)
{
ll c=1;
node* h=head;
while(h!=NULL&&h->s!=str){
h=h->next;
c++;}
return c;
}
void dis(node* head)
{
node* h=head;
while(h!=NULL)
{
cout<<h->s<<" ";
h=h->next;
}
cout<<"\n";
}
int main()
{
ll ch;
string str,s1;
node* head=NULL;
while(1)
{
cout<<"Enter 1:to create\n 2:to insert\n 3:to Delete\n 4:to append\n 5:to Search\n 6:to Quuit\n 7: to display list\n";
cin>>ch;
if(ch==1)
{
cout<<"Enter string: ";
cin>>str;
create(str);
}
else if(ch==2)
{
cout<<"Enter source and destination string: ";
cin>>str>>s1;
head=insert(head,str,s1);
}
else if(ch==3)
{
cout<<"Enter source and destination string: ";
cin>>str>>s1;
head=del(head,str,s1);
}
else if(ch==4)
{
cout<<"Enter string: ";
cin>>str;
head=append(head,str);
}
else if(ch==5)
{
cout<<"Enter string :";
cin>>str;
ll indx=search(head,str);
cout<<str<<" is present at position "<<indx<<endl;
}
else if(ch==7)
dis(head);
else
break;
}
}

//please upvote.