压链栈与进链队列和创建线性表的关系

void CreateFromHead(linklist *h)
{
lisklist *s;
char c;
c=getchar();
while(c!='$')
{
s=(linklist *)malloc(sizeof(linklist));
s->data=c;
s->next=h->next;
h->next=s;
c=getchar();
}
}

int push(LinkStack *top,StackElemType x)
{
LinkStack *new;
new=(LinkStack)malloc(sizeof(LinkStack));
if(new==NULL)return FALSE;
new->data=x;
new->next=top->next;
top->next=new;
return OK;
}

void CreateFromTail(LinkList *h)
{
LinkList *tail,*new;
tail=h;
char c=getchar();
while(c!='$')
{
new=(linklist *)malloc(sizeof(linklist));
new->data=c;
tail->next=new;
tail=new;
c=getchar();
}
tail->next=NULL;
}

int EnterQueue(LinkQueue *q,QueueElemType x){
LinkQueueNode *newnode;
newnode=(LinkQueue*)malloc(sizeof(LinkQueue));
if(newnode==NULL)
return FALSE;
newnode->data=x;
newnode->next=NULL;
q->rear->next=newnode;
q->rear=newnode;
return OK;
}