Data Structure lab 8
Source code: #include <iostream> using namespace std; struct Node{ int num; Node* next; Node*prev; };Node*head=NULL; Node*temp=NULL; //insert at end void add(int n) { Node * newnode=new Node; newnode->num=n; newnode->next=NULL; newnode->prev=NULL; if(head==NULL) { head=newnode; cout<<"Enter Sucessful \n"; } else { temp=head; while(temp->next!=NULL) { temp=temp->next; } temp->next=newnode; newnode->prev=temp; cout<<"Enter Sucessful \n"; } } //delete at end void Delete() { temp=head; { while(temp->next!=NULL) { temp=temp->next; } temp->prev->next=NULL; delete temp; } } //display void display() { temp=head; while(temp->next!=NULL) { cout<<temp->num...