我的作业如下，就是malloc不知道错在哪里，还有不知道还漏了什么内容，请大家帮帮忙，谢谢你们了！
#include <iostream.h>
typedef struct {
float coef;
int expn;
}term,ElemType;
typedef struct{
ElemType data;
struct LNode *next;
}*Link,*Position;
typedef struct {
Link head,tail;
int len;
}LinkList;
typedef LinkList polynomial;
int InitList(LinkList&L){
L.len=0.0=(L.head*)malloc(sizeof(L.head));
L.head=L.tail=0;
L.head->next=NULL;

}
int cmp(term a,term b){
if(a.expn<b.expn) return -1;
if(a.expn>b.expn) return 1;
return 0;
}
int OrderInsert(LinkList&L,ElemType e,int(*cmp)(ElemType,ElemType)){
}
void CreatPolyn(polynomial &P,int m){
InitList(P);h=GetHead(P);
e.coef =0.0;e.expn=-1;SetCurElem(h,e);
for (i=1;i<=m;++i){
cin>>e.coef>>e.expn;
if(!LocateElem(P,e,q,(cmp)())){
if (MakeNode(s,e)) InsFirst(q,s);
}
}
}
void AddPolyn(polynomail& Pa,polynomail &Pb){
ha=GetHead(Pa);hb=GetHead(Pb);
qa=NextPos(Pa,ha); qb=NextPos(Pb,hb)
while(qa&&qb){
a=GetCurElem(qa);b=GetCurElem(qb);
switch(cmp(a,b)){
case -1: ha=qa; qa=NextPos(Pa,qa);break;
case 0:
sum=a.coef+b.coef;
if(sum!=0.0){
SetCurElem(qa,sum);ha=qa;}
else{DelFirst(ha,qa);FreeNode(qa);}
DelFirst(hb,qb); FreeNode(qb);qb=Nextpos(Pb,hb);
qa=NextPos(pa,ha);break;
case 1:
DelFirst(hb,qb);
qb=NextPos(pb,hb);ha=NextPos(pa,ha);break;
}
}
if(!ListEmpty(Pb))Append(pa,qb);
FreeNode(hb):
}