C 在链表中插入

我正在尝试在链接列表中插入节点。我尝试在特定节点的前面、末尾和后面插入节点。 我认为代码很好，应该可以工作。然而，这段代码给出了运行时错误。请解释为什么会出现运行时错误

每一个你失去理智的地方

您应该在所有函数中保留其地址，使用struct node**，并更新指针 使用*head和*prev_节点

看

PS：可能有逻辑错误

---

另外，在完成所有操作后，确保使用免费调用释放内存。

是否给出运行时错误->为什么不说出错误是什么？！？请查看ideone链接。它成功编译，但随后显示运行时错误。几乎任何人都可以编译代码，然后抛出运行时错误。你知道有一个叫做“调试”的开发步骤吗？但是为什么需要给头指针一个引用呢？我在main函数中将其设为NULL。@user3087202您需要传递头的地址，使用函数更新的是头指针的本地副本。struct node**head，表示指向节点指针的指针，您应该在其中传递节点指针的地址。谢谢。明白了

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

// A linked list node
struct node
{
    int data;
    struct node *next;
};


void push(struct node* head, int new_data)
{
/* 1. allocate node */
struct node* new_node = (struct node*) malloc(sizeof(struct node));

/* 2. put in the data  */
new_node->data  = new_data;

/* 3. Make next of new node as head */
new_node->next = head;

/* 4. move the head to point to the new node */
head   = new_node;
}

 /* Given a node prev_node, insert a new node after the given prev_node */
void insertAfter(struct node* prev_node, int new_data)
{
/*1. check if the given prev_node is NULL */
if (prev_node == NULL)
{
  printf("the given previous node cannot be NULL");
  return;
}

/* 2. allocate new node */
struct node* new_node =(struct node*) malloc(sizeof(struct node));

/* 3. put in the data  */
new_node->data  = new_data;

/* 4. Make next of new node as next of prev_node */
new_node->next = prev_node->next;

/* 5. move the next of prev_node as new_node */
prev_node->next = new_node;
}


void append(struct node* head, int new_data)
{
/* 1. allocate node */
struct node* new_node = (struct node*) malloc(sizeof(struct node));

struct node *last = head;  

/* 2. put in the data  */
new_node->data  = new_data;

/* 3. This new node is going to be the last node, so make next of it as NULL*/
new_node->next = NULL;

/* 4. If the Linked List is empty, then make the new node as head */
if (head == NULL)
{
   head = new_node;
   return;
}

/* 5. Else traverse till the last node */
while (last->next != NULL)
    last = last->next;

/* 6. Change the next of last node */
last->next = new_node;
return;
}

// This function prints contents of linked list starting from the given node
void printList(struct node *node)
{
  while (node != NULL)
  {
     printf(" %d ", node->data);
     node = node->next;
  }
}

/* Driver program to test above functions*/
int main()
{
   /* Start with the empty list */
   struct node* head = NULL;


  append(head, 6);
  push(head, 7);
  push(head, 1);
  append(head, 4);
  insertAfter(head->next, 8);
  printf("\n Created Linked list is: ");
  printList(head);

  getchar();
  return 0;
}

void push(struct node** head, int new_data)
{ //... 
  // *head
}

void insertAfter(struct node** prev_node, int new_data)
{ //... 
  // (*prev_node)
}

void append(struct node** head, int new_data)
{ //... 
  // *head
}