Please write a simple C++ Program: Code each separately: 1.) Remove at the beginning 2.) Remove the first two nodes 3.) Remove the last node 4.) Remove all nodes
Explanation / Answer
void deletenode(struct node *&first, int data) { struct node * current = first;// first will have the node after deletion struct node * prev = (node *)malloc(sizeof(node)); while(current!=NULL) { if(current->data!=data) { prev=current; current = current->next; } else { prev->next = current->next; delete current; break; } } } void insertinsortedlist(struct node *& first, int data) { struct node * current = first;// first will have the node after insertion struct node * newnode = (node *)malloc(sizeof(node)); newnode->data = data; struct node * temp = (node *)malloc(sizeof(node)); while(current) { if((current->data next->data > data)) { temp = current->next; current->next = newnode; newnode->next = temp; break; } current = current->next; } }