singly linked lists-Data Structures Using C

#include<stdio.h>
#include<malloc.h>
typedef struct node;
typedef struct List;
void push_back(List* list,int newdata);
void push_front(List* list,int newdata);
void insert_node(List* list,int newdata,int pos);
void remove_node(List* list,int pos);
void init_list(List* list);
void show_list(List* list);
void delete_node(List* list,int pos);
int is_empty(List* list);

typedef struct node
{
	int data;
	struct node* next;
};

typedef struct List
{
	node* head;
	node* tail;
};

void push_back(List* list,int newdata)
{
node* p=(node*)malloc(sizeof(node));
p->data=newdata;
p->next=0ll;
list->tail->next=p;
list->tail=p;
}

void push_front(List* list,int newdata)
{
node* p=(node*)malloc(sizeof(node));
p->data=newdata;
p->next=list->head->next;
list->head=p;
}

void insert_node(List* list,int newdata,int pos)
{
node* p=(node*)malloc(sizeof(node));
p->data=newdata;
node* temp=list->head;
while(--pos)temp=temp->next;
p->next=temp->next;
temp->next=p;
}

void remove_node(List* list,int pos)
{
if(!is_empty(list)){
	node* temp=list->head;
	while(--pos)temp=temp->next;
	node* del=temp->next;
	temp->next=del->next;
	free(del);
	}
}

void init_list(List* list)
{
list->head=(node*)malloc(sizeof(node));
list->tail=(node*)malloc(sizeof(node));
list->tail=list->head;
list->tail->next=0ll;
}

void show_list(List* list)
{
if(!is_empty(list)){
	node* temp=list->head->next;
	while(temp!=0ll){
		printf("%d\n",temp->data);
		temp=temp->next;
		}
	}
}

void delete_node(List* list,int pos)
{
if(!is_empty(list)){
	node* temp=list->head;
	while(--pos)temp=temp->next;
	node* del=temp->next;
	temp->next=del->next;
	free(del);
	}
}

int is_empty(List* list)
{
return list->head==list->tail;	
}

int main()
{
List* list=(List*)malloc(sizeof(List));
init_list(list);

for(int i=1;i<=10;i++)
	push_back(list,i);
delete_node(list,1);
show_list(list);

return 0;
}