diff --git a/DoublyLinkedList/DLL_operations.cpp(C++) b/DoublyLinkedList/DLL_operations.cpp(C++) index e35241d..e69de29 100644 --- a/DoublyLinkedList/DLL_operations.cpp(C++) +++ b/DoublyLinkedList/DLL_operations.cpp(C++) @@ -1,212 +0,0 @@ -#include -using namespace std; -struct node{ -int info; -struct node *next; -struct node *prev; -}*start; - -class dll -{ -public: - void create_list(int value); - void add_begin(int value); - void add_after(int value, int position); - void delete_element(int value); - void display(); - dll() - { - start=NULL; - } -}; - -int main() -{ - int choice, element, position; - dll dl; - while(1) - { - cout<>choice; - switch(choice) - { - case 1: cout<<"Enter the element: "; - cin>>element; - dl.create_list(element); - break; - case 2: cout<<"Enter the element: "; - cin>>element; - dl.add_begin(element); - break; - case 3: cout<<"Enter the element: "; - cin>>element; - cout<<"Insert element after position: "; - cin>>position; - dl.add_after(element,position); - break; - case 4: if(start==NULL) - { - cout<<"List empty, Nothing to delete"<>element; - dl.delete_element(element); - break; - case 5: dl.display(); - break; - case 6: exit(1); - default: cout<<"Wrong Choice"<info=value; - temp->next=NULL; - if(start==NULL) - { - temp->prev=NULL; - start=temp; - } - else - { - s=start; - while(s->next!=NULL) - s=s->next; - s->next=temp; - temp->prev=s; - - } -} - - -void dll::add_begin(int value) -{ - if(start==NULL) - { - cout<<"First create the list"<prev=NULL; - temp->info=value; - temp->next=start; - start->prev=temp; - start=temp; - cout<<"Element inserted"<next; - if(q==NULL) - { - cout<<"There are less than "; - cout<info=value; - if(q->next==NULL) - { - q->next=temp; - temp->next=NULL; - temp->prev=q; - } - else - { - temp->next=q->next; - temp->next->prev=temp; - q->next=temp; - temp->prev=q; - } - cout<<"Element inserted"<info==value) - { - temp=start; - start=start->next; - start->prev=NULL; - cout<<"Element deleted"<next->next != NULL) - { - /*element deleted in between*/ - if(q->next->info==value) - { - temp=q->next; - q->next=temp->next; - temp->next->prev=q; - cout<<"Element deleted"<next; - } - /*Last element deleted*/ - if(q->next->info==value) - { - temp=q->next; - free(temp); - q->next=NULL; - cout<<"Element deleted"<info<<"->"; - q=q->next; - } - cout<<"NULL"<