C语言程序设计 链表及其操作和应用.pptVIP

1.链表的建立 程序段 head = tail = NULL; scanf(%d%s%d, num,name, score); while(num != 0){ p = (struct stud_node *) malloc(size); p-num = num; strcpy(p-name, name); p-score = score; p-next = NULL; if(head == NULL) head = p; else tail-next = p; tail = p; scanf(%d%s%d, num, name, score); } 2. 链表的遍历 ptr-num ptr-score ptr ptr for(ptr = head; ptr != NULL; ptr = ptr - next) printf(%ld, %d, ptr - num, ptr - score); ptr=ptr-next head 9905 Qian 80 NULL 9901 Wang 80 9902 Li 90 链表的遍历－