c언어로 덱을 구현해봤는데 오류가많이납니다...좀길지만 봐주시면 감사하겠습니다.

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
 
typedef struct{
	int key;
	char name[10];
	char grade;
}element;
 
typedef struct doubleListNode{
	element data;
	struct doubleListNode *rlink;
	struct doubleListNode *llink;
}deqNode;
 
typedef struct{
	deqNode* first;
	deqNode* last;
	int lenth;
}deque;
 
deque* creatdeque()                        //공백 이중연결덱 형성
{
	deque *deq;
	deq=(deque*)malloc(sizeof(deque));
	deq->first=NULL;
	deq->last=NULL;
	deq->lenth=0;
	return deq;
}
 
int isEmpty(deque*deq){
	if(deq->lenth==0)
		return 1;
	else
		return 0;
}
 
void insertFirst(deque *deq,element item)
{                                        //연결덱에 첫번째 원소 삽입
	deqNode *newnode;
	newnode=(deqNode*)malloc(sizeof(deqNode));
	newnode->data=item;
	if(deq->lenth==0)
	{deq->first=newnode;
	deq->last=newnode;
	newnode->llink=NULL;
	newnode->rlink=NULL;
	}
	else
	{
		deq->first->llink=newnode;
		newnode->rlink=deq->first;
		newnode->llink=NULL;
		deq->first=newnode;
	}
	deq->lenth++;
}
 
void insertLast(deque* deq,element item)
{
	deqNode* newnode;                               //연결덱의 마지막 원소삽입
	newnode=(deqNode*)malloc(sizeof(deqNode));
	newnode->data=item;
	if(deq->lenth==0)
	{
		newnode->llink=NULL;
		newnode->rlink=NULL;
		deq->first=newnode;
		deq->last=newnode;
	}
	else
	{
		deq->last->rlink=newnode;
		newnode->llink=deq->last;
		newnode->rlink=NULL;
		deq->last=newnode;
	}
	deq->lenth++;
}
 
element deletefirst(deque* deq)
{
	deqNode* temp;                                //연결덱에서 첫번째 원소를 삭제하고 반환
	element item;
	if(deq->lenth==0)
	{
		printf("덱이 비었습니다.");
		exit(1);
	}
	else
	{
		item=deq->first->data;
		temp=deq->first;
		if(deq->first->rlink=NULL)              //원소가 하나일때
		{
			deq->first=NULL;
			deq->last=NULL;
		}
		else
		{
			deq->first=deq->first->rlink;   //원소가 2이상일때
			deq->first->llink=NULL;
		}
		deq->lenth--;
		free(temp);
		return item;
	}
}
element deletelast(deque* deq)
{
	element item;
	deqNode* temp;                                               //연결덱에서 마지막 원소를 삭제하고 반환
 
	if(deq->lenth==0)
	{
		printf("덱이 비었습니다.");
		exit(1);
	}
	else
	{ item=deq->last->data;
		temp=deq->last;
		if(deq->last->llink==NULL)
		{
			deq->first=NULL;
			deq->last=NULL;
		}
		else
		{
			deq->last=deq->last->llink;
			deq->last->rlink=NULL;
		}
		deq->lenth--;
		free(temp);
		return item;
	}
 
}
 
void removefirst(deque* deq)
{                                                   //연결덱에서 첫번째원소삭제
	deqNode * temp;                 
	if(deq->lenth==0)
	{
		printf("덱이비었습니다.");
		exit(1);
	}
	else
	{
		temp=deq->first;
		if(deq->first->rlink==NULL)
			{deq->first=NULL;
			deq->last=NULL;
		}
		else
		{
			deq->first=deq->first->rlink;
			deq->first->llink=NULL;
		}
		deq->lenth--;
		free(temp);
	}
}
void removelast(deque* deq)
{                                                        //연결덱에서 마지막원소삭제
	deqNode*temp;                                     
	if(deq->lenth==0)
	{
		printf("덱이비었습니다");
		exit(1);
	}
 
	else
	{
		temp=deq->last;
		if(deq->last->llink=NULL)
		{
			deq->first=NULL;
			deq->last=NULL;
		}
		else
		{
			deq->last=deq->last->llink;
			deq->last->rlink=NULL;
		}
		deq->lenth--;
		free(temp);
	}
}
 
element peekfirst(deque *deq)
{
	if(deq->lenth==0)                         //연결덱에서 첫번째 원소를 검색해서 반환
	{
		printf("덱이 비었습니다.");
		exit(1);
	}
	else
	{
		return deq->first->data;
	}
}
element peeklast(deque *deq)
{
	if(deq->lenth==0)                             //연결덱에서 마지막 원소를 검색해서 반환
	{
		printf("덱이 비었습니다");
		exit(1);
	}
	else
	{
		return deq->last->data;
	}
 
}
int main()
{
	deque*deq;
	element a,b,c,d;
	a.key=201501514;
	strcpy(a.name,"김영희");
	b.key=201501515;
	strcpy(b.name,"김철수");
	c.key=201501516;
	strcpy(c.name,"홍길동");
	deq=creatdeque();
	insertFirst(deq,a);
	insertLast(deq,b);
	insertLast(deq,c);
	//d=deletefirst(deq);
	//printf("%d","%s",d.key,d.name);
	//d=deletelast(deq);
	//printf("%d","%s",d.key,d.name);
	//removefirst(deq);
 
	//removelast(deq);
 
 
	//d=peeklast(deq);
	//printf("%d","%s",d.key,d.name);
 
 
	d=peekfirst(deq);
	printf("%d %s",d.key,d.name);
 
 
	system("pause");
	return 0;
 
 
}