学步园

简单实现了链表的“插入（后插入方式），遍历”功能，还差删除、判断是否为空功能，代码如下：

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

typedef struct Node
{
	char name[256];
	struct Node *next;
}NODE;

NODE *head;

void insert_back( char *name)
{
	NODE *p = (NODE*)malloc(sizeof(NODE));
	strcpy( p->name, name );
	p->next = NULL;
	if( head == NULL )
	{
	    head = p;
		return ;
	}
	NODE *q = head;
	while( q->next != NULL ) q = q->next;
    q->next = p;
}

void travel()
{
    NODE *p = head;
	while( p != NULL )
	{
		printf("%s\n", p->name );
		p = p->next;
	}
}

int main( void )
{
	insert_back("E:\\123.mp3");
	travel();
	return 0;
}

效果如下：