无表头单链表的总结----如何将已经初始化的结构体数组加入链表关系

struct Student
{
    char ID[N_ID];
    char name[N_name];
    struct Student *next;
}alist[LEN_A],blist[LEN_B];
////以上是结构体
//初始化
struct Student alist[LEN_A] = { {"101","Wang"} ,{"102","Li"},{"105","Zhang"},{"105","Wei"} };
struct Student blist[LEN_B] = 
{ { "101","Zhang" } ,{ "104","Ma" },{ "105","Chen" },{ "107","Guo" },{ "108","liu" } };

//接下来对初始化结构加入链表关系
#include"head.h"
void print(struct Student *p,int sum)   //sum是数组的长度,p是数组的头指针
{
    int i;
    struct Student *head=p;
    for (i=1; i <= sum; i++)
    {
        if (i < sum)
            p->next = head + i;//关键，使得结构体成员的next指向下一个成员 
        else
            p->next = NULL;//使得链表最后加入终止符号null
        printf("%s %s\n", p->ID, p->name);
        if (i < sum)
            p = p->next;//链表指针移动
    }
}