Skip to content

Debugged the deletion code in doubly linked list #12

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
poulomihore wants to merge 2 commits into
base: master
Choose a base branch
from
Open

Debugged the deletion code in doubly linked list #12

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
6778a75
Removed extra hello from output
poulomihore Oct 12, 2017
c031ec1
Debugged Deletion code in doubly_linked_list
poulomihore Oct 13, 2017
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion deletion_in_linkedlist.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -72,7 +72,7 @@ void delete_node(int num,int del)

while(del<num&&i<del)
{
printf("hello");
//printf("hello");
prev=temp;
temp=temp->link;
i=i+1;
Expand Down
43 changes: 21 additions & 22 deletions doubly_linked_list.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -121,7 +121,7 @@ void insertbegin(int s)
void insertend(int s)
{
struct Node *temp=head;
struct Node*prev1;
struct Node* prev1;
while(temp!=NULL)
{
prev1=temp;
Expand All @@ -140,34 +140,33 @@ void insertend(int s)
void delete_node(int del)
{
struct Node *temp=head;
struct Node *prev1;
if (head->data==del)
{
temp=head->next;
temp->prev=NULL;
free(temp);
if(head->next==NULL){
free(temp);
head=NULL;
}
else
temp=temp->next;
if(temp->next!=NULL)
{
while(temp->data!=del)
{
prev1=temp;
temp=temp->next;
else{
head->next->prev=NULL;
head=head->next;
free(temp);
}

struct Node *temp1=temp->next;
prev1->next=temp->next;
temp1->prev=temp->prev;
free(temp);
}
else
{
temp=temp->prev;
temp->next==NULL;
else{
while(temp->next!=NULL){
if(temp->data==del){
temp->prev->next=temp->next;
temp->next->prev=temp->prev;
free(temp);
}
else temp=temp->next;
}
if(temp->data==del){
temp->prev->next=NULL;
free(temp);
}
}

display();
}

Expand Down