Ask you experts: the problem of data structure

hxf1982

struct node {
char * name;
struct node * next;
};
struct node * Head;
Head is the head of the one-way linked list, and is arranged according to the character order of its member variable name.
Write functions to add and remove nodes of type struct node.

liuyuning

This question is a bit big ...

boxer2005

Add: Iterate node by node until the correct insertion position is found.
Deletion: Iterate node by node until you find the node that needs to be deleted.

These are some basic pointer operations. There is nothing complicated. Try it for yourself.

zjwzjw

// Linear list insertion and deletion

#include <stdio.h>
#include <malloc.h>
typedef struct LNode
 {int data;
  struct LNode * next;
  } LNode, * linklist;
int Init (linklist * L)
 (* L = (linklist) malloc (sizeof (LNode));
  (* L)-> next = NULL;
  return 1;
 }
int insert (linklist L, int i, int e)
 {linklist p, s;
  int j = 0;
   p = L;
  while (p&&j <i-1)
  {p = p-> next; j ++;}
   if (! p || j> i-1)
    return 0;
   s = (linklist) malloc (sizeof (LNode));
    s-> data = e;
    s-> next = p-> next;
    p-> next = s;
    return 1;
  }
int del (linklist L, int i, int * e)
 {linklist p, q;
  int j = 0;
  p = L;
  while (p-> next&&j <i-1)
  {p = p-> next; j ++;}
  if (! p-> next || j> i-1)
  return 0;
     q = p-> next;
      p-> next = q-> next;
      * e = q-> data;
      printf ("The deleted number:% d\n\n", * e);
   free (q);
   return 1;
 }
void print (linklist L)
{linklist p;
 for (p = L-> next; p; p = p-> next)
  printf ("% 4d", p-> data);
 printf ("\n");
}
void main ()
{linklist L, p;
 int i, e, j, t;
 t = Init (&L);
 printf ("% d\n\n", t);
 for (i = 1; i <= 5; i ++)
  {scanf ("% d",&e);
   insert (L, i, e);
  }
  print (L);
  printf ("\n");
  printf ("Enter the delete seat:");
  scanf ("% d",&j);
  printf ("\n");
  del (L, j,&e);
  print (L);
  printf ("\n\n");
  }