#includeiostream#includecstdio#includecstdlibusing names.pdf
- 1. #include #include #include using namespace std; /* * Node Declaration */ struct node { int info; struct node *next; }*last; /* * Class Declaration */ class circular_llist { public: void create_node(int value); void add_begin(int value); void add_after(int value, int position); void delete_element(int value); void search_element(int value); void display_list(); void update(); void sort(); circular_llist() { last = NULL; } }; /* * Create Circular Link List */ void circular_llist::create_node(int value)
- 2. { struct node *temp; temp = new(struct node); temp->info = value; if (last == NULL) { last = temp; temp->next = last; } else { temp->next = last->next; last->next = temp; last = temp; } } /* * Insertion of element at beginning */ void circular_llist::add_begin(int value) { if (last == NULL) { cout<<"First Create the list."<info = value; temp->next = last->next; last->next = temp; } /* * Deletion of element from the list */ void circular_llist::delete_element(int value) { struct node *temp, *s; s = last->next; /* If List has only one element*/ if (last->next == last && last->info == value)
- 3. { temp = last; last = NULL; free(temp); return; } if (s->info == value) /*First Element Deletion*/ { temp = s; last->next = s->next; free(temp); return; } while (s->next != last) { /*Deletion of Element in between*/ if (s->next->info == value) { temp = s->next; s->next = temp->next; free(temp); cout<<"Element "<next; } /*Deletion of last element*/ if (s->next->info == value) { temp = s->next; s->next = last->next; free(temp); last = s; return; } /* * Display Circular Link List */ void circular_llist::display_list()
- 4. { struct node *s; if (last == NULL) { cout<<"List is empty, nothing to display"< Solution #include #include #include using namespace std; /* * Node Declaration */ struct node { int info; struct node *next; }*last; /* * Class Declaration */ class circular_llist { public: void create_node(int value); void add_begin(int value); void add_after(int value, int position); void delete_element(int value); void search_element(int value); void display_list(); void update(); void sort(); circular_llist() { last = NULL;
- 5. } }; /* * Create Circular Link List */ void circular_llist::create_node(int value) { struct node *temp; temp = new(struct node); temp->info = value; if (last == NULL) { last = temp; temp->next = last; } else { temp->next = last->next; last->next = temp; last = temp; } } /* * Insertion of element at beginning */ void circular_llist::add_begin(int value) { if (last == NULL) { cout<<"First Create the list."<info = value; temp->next = last->next; last->next = temp; } /* * Deletion of element from the list */
- 6. void circular_llist::delete_element(int value) { struct node *temp, *s; s = last->next; /* If List has only one element*/ if (last->next == last && last->info == value) { temp = last; last = NULL; free(temp); return; } if (s->info == value) /*First Element Deletion*/ { temp = s; last->next = s->next; free(temp); return; } while (s->next != last) { /*Deletion of Element in between*/ if (s->next->info == value) { temp = s->next; s->next = temp->next; free(temp); cout<<"Element "<next; } /*Deletion of last element*/ if (s->next->info == value) { temp = s->next; s->next = last->next; free(temp); last = s;
- 7. return; } /* * Display Circular Link List */ void circular_llist::display_list() { struct node *s; if (last == NULL) { cout<<"List is empty, nothing to display"<