Question

implement delete node function in c++ language

// Delete node containing word from list if it is present void delNode (DLList list, char *str) (

I just need a basic doubly linked list code for the delete node portion of the code

Answer 1

#give it a thumbs up

c++ code

#include <bits/stdc++.h> #include-string . h> using namespace std; 4 7 II/doubly linked list structNode 8 9 10 char arr[25]; Node* next; Node* prev; 12 13 ; 14 15 16 17 18 19 20 21 Function to delete a node in a Doubly Linked List. void deleteNode (Node** head, char *str) // base case if (*head = NULL) return Node temp*head; Node* start *head ; while ( temp ! =NULL) 23 25 26 /starting node

27 28 29 if ( ( str㎝p ( temp->arr, str)=-0) &&temp=start) //change head pointer *thead = *temp->next; start *head; start->prev=NULL ; second node to 31 32 34 35 36 37 38 39 40 41 42 43 //last node else if((strcmp (temp->arr, str) 0)&&temp->next=NULL) /put NULL to second last nod temp=temp->prev ; temp->next-NULL; //other nodes else if((strcmp(temp->arr,str)0)) //put next address to previous node and previous address to next node Node* temp2; temp2弍emp->prev ; temp=temp->next ; temp2->next emp ; temp->prev-temp2 45 4б 47 48 49 50

51 52 53 54 55 L temp temp->next; return;

OUTPUT

Original Linked list goodbye bye hello hi node to be deleted: hi Modified Linked list goodbye bye hello

Original Linked list goodbye bye hello hi node to be deleted: hello Modified Linked list goodbye bye hi

Original Linked list goodbye bye hello hi node to be deleted: goodbye Modified Linked list bye hello hi

Code text

// C++ program to delete a node from
// Doubly Linked List
#include <bits/stdc++.h>
#include<string.h>
using namespace std;

//doubly linked list
struct Node
{
   char arr[25];
   Node* next;
   Node* prev;
};

// Function to delete a node in a Doubly Linked List.
void deleteNode(Node** head, char *str)
{
   // base case
   if (*head == NULL)
       return;

Node* temp = *head;
Node* start = *head;
while(temp!=NULL)
{
//starting node
if((strcmp(temp->arr,str)==0)&&temp==start)
{
//change head pointer to second node
**head = *temp->next;
start = *head;
start->prev=NULL;

}
//last node
else if((strcmp(temp->arr,str)==0)&&temp->next==NULL)
{
//put NULL to second last node
temp=temp->prev;
temp->next=NULL;
}
//other nodes
else if((strcmp(temp->arr,str)==0))
{
//put next address to previous node and previous address to next node
Node* temp2;
temp2=temp->prev;
temp=temp->next;
temp2->next=temp;
temp->prev=temp2;
}
temp = temp->next;
}
return;
}

#comment for any queries