A data structure problem (data written test questions)

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.

I hope that you will give pointers in detail, the data structure I learned very well!

zmw9835

struct node insert (struct node * newnode)
{
struct node * p, * q;
p = head;
while (p-> next-> name <newnode-> name) {p = p-> next; q = p;}
q-> next = newnode; newnode-> next = p;
return newnode;
}

zmw9835

struct node * delete (struct node * newnode)
{
struct node * p, * q;
p = head;
while (! p&&(p-> next-> name! = newnode-> name)) p = p-> next;
if (! p) {printf ("No such node in the list"); return NULL;}
else {return newnode;}
}

zmw9835

Some errors, roughly like this.

hxf1982

Thanks everyone!

variolite

typedef struct node * node_ptr;

struct node
{
    element_type element;
    node_ptr next;
};

void sort_list (node_ptr L)
{
    node_ptr p, tmp, min;
    
    for (p = L-> next; p! = NULL; p = p-> next)
    {
        for (tmp = p-> next; tmp! = NULL; tmp = tmp-> next)
        {
            min = NULL;
            if (tmp-> element <p-> element)
            {
                min = tmp;
            }
        }
        
        if (min! = NULL)
        {
            swap (&min-> element,&p-> element);
        }
    }
}

kulizard

while (p-> next-> name <newnode-> name)

How can strings be compared like this?

To use strcmp ()

mars1004

Linked lists are best sorted when inserted, rather than waiting to be sorted together after insertion.

kevinak123

Create a new linked list
Iterate through the current linked list and insert into the new linked list.

Science-wu

Linked lists are best sorted when inserted, rather than waiting to be sorted together after insertion.