单链表 创建（无头结头 尾插法）和打印

#define LEN sizeof(node)
typedef struct Node{
	int data;
	struct Node * next;
}node;//定义结点node
node * creat_link(int n){
	node * head = (node *)malloc(LEN);
	node * h = (node *)malloc(LEN);
	h = head;
	h->next = NULL;
	for (int i = 1; i <=10; i++){
		node * p = (node *)malloc(LEN);
		h->data = i;
		p->next = h->next;
		h->next = p;
		h= p;//尾插法
	}
	return head;
}

void printf_link(node *head,int n){
	node * p = (node *)malloc(LEN);
	p = head;
	for (int i = 1; i <= n;i++){
		printf("%d\n", p->data);
		p = p->next;
	}
}
int main(){

	node * head = (node*)malloc(LEN);
	 head = creat_link(10);
	printf_link(head,10);

	return 0;
}