c语言单链表的创建与遍历

#define LEN sizeof(node)
typedef struct Node{
	int data;
	struct Node *next;
}node;
node * creatnode(){
	node* head, *h;
	head = (node*)malloc(LEN);
	head->next = NULL;
	h = head;
	for (int i = 1; i <= 10; i++){
		node * p = (node*)malloc(LEN);
		p->data = i;
		p->next = h->next;
		h->next = p;
		//h = p;
    }
	return head;
}
void printfnode(node * head){
	node *p;

	if (head == NULL){
		printf("error\n");
	}
	else{
		p = head->next;
		while (p != NULL){
			printf("%d\t", p->data);
			p = p->next;
		}
		
		
	}
}
int main(){
	node *head;
	head = creatnode();
	printfnode(head);
	putchar(10);
	return 0;
}