demo9.9链表动态创建之头插法.c

#include <stdio.h>
#include <stdlib.h>
struct Test 
{
	int data;
	struct Test *next;
	
	
};
void printlink(struct Test *head)//链表动态遍历
{
	struct Test *point;
	point = head;
	while (point != NULL){
		printf("%d ",point ->data);
		point = point ->next;
	}
	putchar('\n');
	
	
}
struct Test *insertNodehead(struct Test *head)//头插法动态创建链表
{
	
	struct Test *new =head;
	while(1){
		new = (struct Test *)malloc(sizeof(struct Test));
		printf("input your node data\n");
		scanf("%d",&(new->data));
		if(new->data==0){
			printf("0 quit\n");
			return head;
		}
		if(head == NULL){
			head = new;
		}else{
			new->next = head;
			head = new;
		}
	}
	return head;
	
}
int main()
{
	struct Test *head;
	head = NULL;
	head = insertNodehead(head);//头插法动态创建链表
	printlink(head);
	
	
	
	return 0;
}```