再回首，数据结构——头插法、尾插法建表

最近在复习数据结构，顺便看看大一的时候写的代码，看完之后比当初有了更加深刻的体会。

 

//头插法建表
void CreateListF (Node *l, int a[], int n)
{
	Node *s;
	int i;
	
	l = (Node *)malloc(sizeof(Node));
	l->next = NULL;		//建立头结点
	
	for (i = 0; i < n; i++)
	{
		s = (Node *)malloc(sizeof(Node));
		s->data = a[i];
		s->next = l->next;
		l->next = s;
	}
}

//尾插法建表
void CreateListL (NOde *l, int a[], int n)
{
	Node *s, *r;
	int i;
	
	l = (Node *)malloc(sizeof(Node));
	l->next = NULL;		//建立头结点
	
	r = l;
	for (i = 0; i < n; i++)
	{
		s = (Node *)malloc(sizeof(Node));
		s->data = a[i];
		r->next = s;
		r = s;
	}
	
	r->next = NULL;
}