singly linked list-Data Structures Using C

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

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

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

void push_back(linked_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(linked_list* list,int newdata)
{
node* p=(node*)malloc(sizeof(node));
p->data=newdata;
p->next=list->head->next;
list->head=p;
}

void insert_node(linked_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(linked_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(linked_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(linked_list* list)
{
if(!is_empty(list)){
	node* temp=list->head->next;
	while(temp!=0ll){
		printf("%d\n",temp->data);
		temp=temp->next;
		}
	}
}

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

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

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

return 0;
}