链表的插入insert

文件:	student MIB0.01源码.zip
大小:	61KB
下载:	下载

/*================================
 文件名: insert.c
 功能: 插入有序链表
 参数:     无
 返回值: 建链表的首地址
 =================================*/
#include "main.h"

TYPE *insert() //新节点插入有序链表 (由小到大)
{
    TYPE *p; //保存当前当需要检测的节点地址
    TYPE *temp; //临时指针变量
    TYPE *Node = (TYPE *)malloc(sizeof(TYPE));
    
    printf("请输入学号: ");
    scanf("%d", &Node->num);
    printf("请输入姓名: ");
    scanf("%s", Node->name);

    if(head == NULL)
    {
        head = Node;
        Node->next = NULL;    
        Node = NULL; //防止野指针
    }
    else
    {
        p = head;
        while( p != NULL && p->num < Node->num )
        {
            temp = p;
            p = p->next;
        }                        //1寻找前驱阶段指针
        if(p == head)            //开始插入
        {
            Node->next = head;        
            head = Node;
        }
        else
        {
            temp->next = Node;
            Node->next = p;
            Node = NULL;
        }
   }
    return head;
}