Question
In: Computer Science
Please use C++ to complete this question follow the requirement. Question: Implement a class called DoublyLinkedList....
Please use C++ to complete this question follow the requirement.
Question: Implement a class called DoublyLinkedList. In the main function, instantiate the DoublyLinkedList class and make sure that there is a user loop and a menu so that the user can access all the list operators. You should implement the following operators, and any others that you may deem best. DestroyList InitializeList GetFirst InsertFirst, InsertLast, Insert DeleteFirst, DeleteLast, Delete IsEmpty Length Print, ReversePrint
Solutions
Expert Solution
#include<iostream>
#include<cstdio>
#include<cstdlib>
using namespace std;
struct node
{
int value;
struct node* next;
struct node* prev;
};
struct node* head;
struct node* tail;
void init()
{
head=NULL;
tail=NULL;
}
void insertFirst(int element)
{
struct node* newItem;
newItem=new node;
if(head==NULL)
{
head=newItem;
newItem->prev=NULL;
newItem->value=element;
newItem->next=NULL;
tail=newItem;
}
else
{
newItem->next=head;
newItem->value=element;
newItem->prev=NULL;
head->prev=newItem;
head=newItem;
}
}
void insertLast(int element)
{
struct node* newItem;
newItem=new node;
newItem->value=element;
if(head==NULL)
{
head=newItem;
newItem->prev=NULL;
newItem->next=NULL;
tail=newItem;
}
else
{
newItem->prev=tail;
tail->next=newItem;
newItem->next=NULL;
tail=newItem;
}
}
void insertAfter(int old, int element)
{
struct node* newItem;
newItem=new node;
struct node* temp;
temp=head;
if(head==NULL)
{
cout<<"could not insert"<<endl;
return;
}
if(head==tail)
{
if(head->value!=old)
{
cout<<"could not insert"<<endl;
return;
}
newItem->value=element;
head->next=newItem;
newItem->next=NULL;
head->prev=NULL;
newItem->prev=head;
tail=newItem;
return;
}
if(tail->value==element)
{
newItem->next=NULL;
newItem->prev=tail;
tail->next=newItem;
tail=newItem;
return;
}
while(temp->value!=old)
{
temp=temp->next;
if(temp==NULL)
{
cout<<"Could not insert"<<endl;
cout<<"element not found"<<endl;
return;
}
}
newItem->next=temp->next;
newItem->prev=temp;
newItem->value=element;
temp->next->prev=newItem;
temp->next=newItem;
}
void deleteFirst()
{
if(head==NULL)
{
return;
}
if(head==tail)///one element in the list
{
struct node* cur;
cur=head;
head=NULL;
tail=NULL;
delete cur;
return;
}
else
{
struct node* cur;
cur=head;
head=head->next;
head->prev=NULL;
delete cur;
}
}
void deleteLast()
{
if(head==NULL) return;
if(head==tail)
{
struct node* cur;
cur=head;
head=NULL;
tail=NULL;
delete cur;
return;
}
else
{
struct node* cur;
cur=tail;
tail=tail->prev;
tail->next=NULL;
delete cur;
}
}
void deleteItem(int element)
{
struct node* temp;
temp=head;
if(head==tail)
{
if(head->value!=element)
{
cout<<"could not delete"<<endl;
return;
}
head=NULL;
tail=NULL;
delete temp;
return;
}
if(head->value==element)
{
head=head->next;
head->prev=NULL;
delete temp;
return;
}
else if(tail->value==element)
{
temp=tail;
tail=tail->prev;
tail->next=NULL;
delete temp;
return;
}
while(temp->value!=element)
{
temp=temp->next;
if(temp==NULL)
{
cout<<"element not found"<<endl;
return;
}
}
temp->next->prev=temp->prev;
temp->prev->next=temp->next;
delete temp;
}
struct node* searchItem(int element)
{
struct node* temp;
temp=head;
while(temp!=NULL)
{
if(temp->value==element)
{
return temp;
break;
}
temp=temp->next;
}
return NULL;
}
void printList()
{
struct node* temp;
temp=head;
while(temp!=NULL)
{
printf("%d->",temp->value);
temp=temp->next;
}
puts("");
}
void printReverse()
{
struct node* temp;
temp=tail;
while(temp!=NULL)
{
cout<<temp->value<<"->";
temp=temp->prev;
}
cout<<endl;
}
void makereverse()
{
struct node* prv=NULL;
struct node* cur=head;
struct node* nxt;
while(cur!=NULL)
{
nxt=cur->next;
cur->next=prv;
prv=cur;
cur=nxt;
}
head=prv;
}
int dltfrst()
{
if(head==NULL)
{
return 0;
}
int prev;
prev=head->value;
if(head==tail)///one element in the list
{
struct node* cur;
cur=head;
head=NULL;
tail=NULL;
delete cur;
return prev;
}
else
{
struct node* cur;
cur=head;
head=head->next;
head->prev=NULL;
delete cur;
return prev;
}
}
int dltlast()
{
if(head==NULL) return 0;
int prev;
prev=tail->value;
if(head==tail)
{
struct node* cur;
cur=head;
head=NULL;
tail=NULL;
delete cur;
return prev;
}
else
{
struct node* cur;
cur=tail;
tail=tail->prev;
tail->next=NULL;
delete cur;
return prev;
}
}
void leftRotate(int x)
{
for(int i=0;i<x;i++)
{
int a=dltfrst();
insertLast(a);
}
}
void rightRotate(int x)
{
for(int i=0;i<x;i++)
{
int a=dltlast();
insertFirst(a);
}
}
int main()
{
init();
int choice;
while(1)
{
printf("1.InsertFirst 2. InsertLast 3. InsertAfter 4.DeleteFirst 5. DeleteLast\n");
printf("6.SearchItem 7. PrintList 8. ReversePrint 9. DeleteItem \n");
printf("10. Left Rotate 11. Right Rotate 12. Exit 13.Make reverse\n");
cin>>choice;
if(choice==1)
{
int element;
cout<<"Enter element_";
cin>>element;
insertFirst(element);
printList();
}
else if(choice==2)
{
int element;
cout<<"Enter element_";
cin>>element;
insertLast(element);
printList();
}
else if(choice==3)
{
int old,newitem;
cout<<"Enter Old Item_";
cin>>old;
cout<<"Enter new Item_";
cin>>newitem;
insertAfter(old,newitem);
printList();
}
else if(choice==4)
{
deleteFirst();
printList();
}
else if(choice==5)
{
deleteLast();
printList();
}
else if(choice==6)
{
int item;
cout<<"Enter Item to Search_";
cin>>item;
struct node* ans=searchItem(item);
if(ans!=NULL) cout<<"FOUND "<<ans->value<<endl;
else cout<<"NOT FOUND"<<endl;
}
else if(choice==7)
{
printList();
}
else if(choice==8)
{
printReverse();
}
else if(choice==9)
{
int element;
cin>>element;
deleteItem(element);
printList();
}
else if(choice==10)
{
int x;
cin>>x;
leftRotate(x);
printList();
}
else if(choice==11)
{
int x;
cin>>x;
rightRotate(x);
printList();
}
else if(choice==12)
{
break;
}
else if(choice==13)
{
makereverse();
}
}
return 0;
}
venereology answered 1 month agoRelated Solutions
Please complete absolutely follow the requirements. Thanks! Implement a stack ADT by writing a class called...
Please Use C++ to finish as the requirements. Implement a class called SinglyLinkedList. In the main...
Implement a class called DoublyLinkedList. In the main function, instantiate the DoublyLinkedList class and make sure that there is a user loop and a menu so that the user can access all the list operators.
implement the reverse() method that changes the ordering of the items within a doublylinkedlist class. don't...
C++ program homework question 1 1. Create and implement a class called clockType with the following...
In C++, implement a class called setOper that provides several simple set operations. The class only...
Overview For this assignment, implement and use the methods for a class called Seller that represents...
Overview For this assignment, implement and use the methods for a class called Seller that represents...
Hello, Please follow and answer the requirement on these question based on the case company which...
Complete the following for full credit in this assignment: Complete the coding requirement for the Class...
- 1. It is the end of September and the current AUD/USD exchange rate is 1.9230, the...
- I'm having trouble understanding this concept. I already completed the first part now I need to...
- A student mixes 31.0 mL of 3.24 M Pb(NO3)2(aq) with 20.0 mL of 0.00217 M NaI(aq)....
- A perpetuity pays $1000 at the end of every month for 11 months of each year....
- ***This is done with Java programming*** Write a well-documented (commented) program, “ISBN,” that takes a 9-digit...
- how to read a csv file in php and make a html table? Acme,Walmart,Ross,BJs,Target,Marshalls,Foot Locker,Giant,Charming Charlie...
- 1. The development of a forensic lab for computers and mobile devices involves numerous specialized tools....