我看书看的饶啊饶啊。。看到什么结点就头痛。。。真不知道它是怎么饶的。。。

要什么例子呀
说明白点

struct node* createl()
{
  struct node* head=NULL,*p;
float f;
while(1)
{
  p=(struct node*)malloc(sizeof(struct node));
scanf("%d",&p->num);
if(p->num==0) break;
scanf("%f",&f);p->score=f;
p->next=NULL;
p->next=head;
head=p;}
free(p);
return head;
}
红字的地方什么意思啊。。。。怎么一会儿空一会儿又赋值的。。。

你看的什么书啊,显然写错了,换本书看吧
第一句p->next=NULL;没用的

这个建链表的函数确实有问题耶，
那一段是不是打错了，不懂他什么意思

这样写或许更容易明白点：
typedef struct node{
 int data;
 struct node * next;
}node,*List;
List createLink(List head)
{
    printf("The System is ready to create Link...\tBy:Bai Chunli\n");
    List p,q;
    p=(List)malloc(sizeof(node));
    head=(List)malloc(sizeof(node));
    printf("input data NO.1: >");
    scanf("%d",&p->one);
    printf("input data NO.2: >");
    scanf("%d",&p->exp);
    p->next=NULL;
    head=p;

    printf("------next link-------\n");

    while(1)
    {
        q=(List)malloc(sizeof(node));
        printf("input data NO.1: >");
         scanf("%d",&q->one);
        if(q->one==0)
        {
            printf("------link end--------\n");
            break;
        }
        printf("input data NO.2: >");
        scanf("%d",&q->exp);

        printf("------next link-------\n");

        q->next=NULL;
        p->next=q;
        p=q;
    }
    return head;
}

[[italic] 本帖最后由 icelovebai 于 2008-1-21 22:15 编辑 [/italic]]

LZ 的那个建立链表的函数应该不行吧

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

//链表结构
struct list
{
    char ch;
    struct list *next;
};

//为链表结构创建别名
typedef struct list *LISTPTR;

//函数原形
LISTPTR addToList(char ch,LISTPTR first);
void freeMemorgList(LISTPTR first);
void printList(LISTPTR first);

//程序入口
void main()
{
    LISTPTR first = NULL;
    int i = 0;
    char ch;
    char trash[256];

    while(i++ < 7)
    {
        ch = 0;
        printf("Enter %d",i);
        do
        {
            printf("Must to 'a'-'z'");
            ch = getc(stdin);    //从键盘得到一个字符
            gets(trash);        //清空键盘缓冲区多余字符
        }while((ch < 'a' || ch > 'z') && (ch < 'A' || ch > 'Z'));
        first = addToList(ch,first);
    }

    printList(first);
    freeMemorgList(first);
}

//添加链表节点函数并对节点排序
LISTPTR addToList(char ch,LISTPTR first)
{
    LISTPTR new_rec = NULL;
    LISTPTR tmp_rec = NULL;
    LISTPTR prev_rec = NULL;

    new_rec = (LISTPTR)malloc(sizeof(list));
    if(!new_rec)
    {
        puts("memory error..");
        getch();
        exit(1);
    }
    new_rec->ch = ch;
    new_rec->next = NULL;
    if(first==NULL)
    {
        first = new_rec;
        new_rec->next = NULL;
    }
    else if(new_rec->ch < first->ch)
    {
        new_rec->next = first;
        first = new_rec;
    }
    else
    {
        tmp_rec = first->next;
        prev_rec = first;
        if(tmp_rec==NULL)
        {
            prev_rec->next = new_rec;
        }
        else
        {
            while((tmp_rec->next!=NULL))
            {
                if(new_rec->ch < tmp_rec->ch)
                {
                    new_rec->next = tmp_rec;
                    /*if(new_rec->next != prev_rec->next)//调试代码
                    {
                        puts("ERROR");
                        getch();
                        exit(0);
                    }*/
                    prev_rec->next = new_rec;
                    break;
                }
                else
                {
                    tmp_rec = tmp_rec->next;
                    prev_rec = prev_rec->next;
                }
            }

            if(tmp_rec->next == NULL)
            {
                if(new_rec->ch < tmp_rec->ch)
                {
                    new_rec->next = tmp_rec;
                    prev_rec->next = new_rec;
                }
                else
                {
                    tmp_rec->next = new_rec;
                    new_rec->next = NULL;
                }
            }
        }
    }

    return (first);
}

//打印链表内容
void printList(LISTPTR first)
{
    int counter =1;

    while(first != NULL)
    {
        printf("%X\t",first);
        printf("%d\t%c\t",counter++,first->ch);
        printf("%X\n",first->next);
        first = first->next;
    }
}

//释放链表占用的全部内存
void freeMemorgList(LISTPTR first)
{
    LISTPTR cur_ptr,next_rec;
    cur_ptr = first;

    while(cur_ptr != NULL)
    {
        next_rec = cur_ptr->next;
        free(cur_ptr);
        cur_ptr = next_rec;
    }
}

我在研究大家写的东西啊。。。谢谢大家哦。链表好烦啊。这本书是我们大学的上课书啊。

现在也在学习链表，好头大，一下真难理解，有谁有对这方面讲的比较讲义或例子吗？