如何刪除C中的雙向鏈表中的備用節點？

Question

我寫了下面的代碼，但執行create（）函數後停止工作。我想從頭節點開始刪除備用元素。我的delete_Alt（）函數是否正確？請告訴我我錯在哪裏。

#include <stdio.h> 
#include <stdlib.h> 

// using a structure 
typedef struct mynode { 
    int data; 
    struct mynode *prev; // to point to previous node 
    struct mynode *link; // to point to next node 
} node; 
node *head = NULL; 

// creating the list 
void create() { 
    node *p, *q; 
    int ch; 
    do { 
     p = (node *)malloc(sizeof(node)); 
     printf("enter data\n"); 
     scanf("%d", &p->data); 
     if (head == NULL) 
     { 
      p->prev = head; 
      q = p; 
     } 
     else 
     { 
      p->prev = q; 
      p->link = NULL; 
      q->link = p; 
      q = p; 
     } 
     printf("create another node?, press 1 "); 
     scanf ("%d",&ch); 
    } while(ch==1); 
} 

//to delete alternate elements 
void delete_Alt() { 
    if (head == NULL) 
     printf("Empty list...ERROR"); 

    node *previous, *current, *next;  
    previous = head; 
    current = head->link; 
    while (previous !=NULL && current != NULL) { 
     previous->prev = current->prev; 
     previous->link = current->link; 

     next = current->link; 
     previous->link = next; 
     next->prev = previous; 

     free(current); 
    } 
} 

// print the list 
void display() { 
    node *temp; 
    temp = head; 
    while (temp != NULL) { 
     printf("%d ",temp->data); 
     temp = temp->link; 
    } 
    printf("\n"); 
} 

int main() { 
    node *head = NULL; 
    create(); 
    printf("List before deleting is: "); 
    display(); 
    delete_Alt(); 
    printf("List after deleting is:  "); 
    display(); 
return 0; 
} 

Answer 1

在你的程序中，你分配一個值只有一次頭：

node *head = NULL; 

那麼它的價值不會改變。

Answer 2

您從未將「頭」分配給列表中第一個創建的元素。因此它總是空的。試試這個：

if (head == NULL) 
{ 
    p->prev = head; 
    head = p;  
    q = p; 
} 

在你delete_alt，你需要這樣做：

while (previous !=NULL && current != NULL) { 
    previous->link = current->link; 
    next = current->link; 
    free(current); 
    if(next) { 
     next->prev = previous; 
     current = next->link; 
    } 
    else current = NULL; 
    previous = next; 
} 

這裏試試：https://repl.it/HK2P/0

Answer 3

你正在做在創建一些小錯誤，以及在刪除功能...

這裏是更新的代碼嘗試一下...

#include <stdio.h> 
#include <stdlib.h> 

// using a structure 
typedef struct mynode { 
    int data; 
    struct mynode *prev; // to point to previous node 
    struct mynode *link; // to point to next node 
} node; 
node *head = NULL; 

// creating the list 
void create() { 
    node *p, *q; 
    int ch; 
    do { 
     p = (node *)malloc(sizeof(node)); 
     printf("enter data\n"); 
     scanf("%d", &p->data); 
     p->link = NULL; 
     if (head == NULL) 
     { 
      p->prev = NULL; 
      head = p; 
     } 
     else 
     { 
      q = head; 
      while (q->link != NULL) 
      q = q->link; 
      p->prev = q; 
      q->link = p; 
     } 
     printf("create another node?, press 1 "); 
     scanf ("%d",&ch); 
    } while(ch==1); 
} 

//to delete alternate elements 
void delete_Alt() { 
    if (head == NULL) 
     printf("Empty list...ERROR"); 

    node *previous, *current, *next;  
    previous = head; 
    current = head->link; 
    while (previous !=NULL && current != NULL) 
    { 
     previous->link = current->link; 
     next = current->link; 
     free(current); 
     if(next) 
     { 
      next->prev = previous; 
      current = next->link; 
     } 
     else 
     current = NULL; 
     previous = next; 
    } 
} 

// print the list 
void display() { 
    node *temp; 
    temp = head; 
    while (temp != NULL) { 
     printf("%d ",temp->data); 
     temp = temp->link; 
    } 
    printf("\n"); 
} 

int main() { 
    node *head = NULL; 
    create(); 
    printf("List before deleting is: "); 
    display(); 
    delete_Alt(); 
    printf("List after deleting is:  "); 
    display(); 
return 0; 
}