Create a linked list by head interpolation and output all elements

Create linked list by head insertion

Linklist Create_list(Linklist head){
    // Head insertion creates a single chain table 
	head =(Linklist)malloc(sizeof(LNode));// Open up memory space for header pointers 
    LNode *node=NULL;// Define the working pointer 
	int count=0;// Number of nodes created 
	head->next=NULL;
	node=head->next;// The pointer field of the last node is always saved as NULL
	printf(" Enter the length of the linked list \n");
	scanf("%d",&count);
	printf(" The linked list is created !\n");
	for(int i=0;i<count;i++){
    
		node=(LNode *)malloc(sizeof(LNode));// Open up memory space for new nodes 
		node->data=i;// Assign a value to the new node 
		node->next=head->next;// The address of the next node pointed to by the header pointer , Assigned to the newly created node next
		head->next=node;// Assign the address of the newly created node to the next node of the header pointer 
	}
    return head;
}

Access all elements

void printL(Linklist L){
    // Access all elements 
	LNode *p;
	p=L->next;
	while(p!=NULL){
    
		printf(" The first %d Elements are %d\n",p->data,p->data);
		p=p->next;
	}
}

Complete implementation

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

typedef struct LNode{
    // Define the structure of the structure declaration table 
	int data;// Data fields 
	struct LNode *next;// Pointer to the domain 
}LNode,*Linklist;


Linklist Create_list(Linklist head){
    // Head insertion creates a single chain table 
	head =(Linklist)malloc(sizeof(LNode));// Open up memory space for header pointers 
    LNode *node=NULL;// Define the working pointer 
	int count=0;// Number of nodes created 
	head->next=NULL;
	node=head->next;// The pointer field of the last node is always saved as NULL
	printf(" Enter the length of the linked list ");
	scanf("%d",&count);
	printf(" The linked list is created !\n");
	for(int i=0;i<count;i++){
    
		node=(LNode *)malloc(sizeof(LNode));// Open up memory space for new nodes 
		node->data=i;// Assign a value to the new node 
		node->next=head->next;// The address of the next node pointed to by the header pointer , Assigned to the newly created node next
		head->next=node;// Assign the address of the newly created node to the next node of the header pointer 
	}
    return head;
}
void printL(Linklist L){
    // Access all elements 
	LNode *p;
	p=L->next;
	while(p!=NULL){
    
		printf(" The first %d Elements are %d\n",p->data,p->data);
		p=p->next;
	}
}

void main(){
    
LNode *head;// Declare the header node 
LNode* p = Create_list(head); //  Reference the header node to create a linked list 
printL(p);
}

Specific effect

summary ： The head insertion method creates a linked list to realize the reverse order input , Each new element is placed after the header node , Can be used as a subsequent descending sort .