A data structure problem (data written test questions)

s36542616

struct node
{
char * name;
struct node * next;
};

struct node * Head;

Head-> name = NULL;
Head-> next = NULL;

void insert (struct node * newnode)
{
struct node * p, * q;
p = Head;
q = p;
if (p-> next == NULL)
{
p-> next = newnode;
newnode-> next = NULL;
}
else
{
while (p-> next! = NULL || strcmp (p-> name, newnode-> name) <0)
{
q = p;
p = p-> next;
}
q-> next = newnod;
newnod-> next = q;
}
return;
}

void del (struct node * oldnode)
{
struct node * p, * q;
p = Head;
if (p-> next == NULL)
{
printf ("there is no data\n");
exit (1);
}
else
{
while (p-> next! = NULL || strcmp (p-> name, oldnode-> name)! = 0)
{
q = p;
p = p-> next;
}
q-> next = p-> next;
delete (p);
}
return;
}

The brother who just wrote helps find errors

Is there a good algorithm for sequential search?

shaw84210

Upstairs, in your insert (), you don't seem to consider the case where Head is NULL?

candyjoyee

Looks like too many errors :)
Don't think about a good algorithm, the linked list can only be searched sequentially

3allen

mark

sanshi

Is it very simple, first find the node before the position to be inserted, and then insert or delete it, as long as you carefully consider the special circumstances of the head and tail, it is ok

s36542616

There are really a lot of problems, I still have to debug it all at once.

1.Head-> name = NULL;
  Head-> next = NULL;
2.q-> next = newnod;
  newnod-> next = q;
3.delete (p);

It's been a long time since I used C language ~