#include<stdio.h>
#include<stdlib.h>
typedef struct QNOde{
int data;
struct QNOde *next;
}QNode,*QueueList;

void EnQueue(QueueList *head,QueueList *tail,int value);
void Print(QueueList head);

int main()
{
QueueList head=NULL,tail=NULL;
int i,n,value;

printf("Please input node n: ");
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&value);
EnQueue(&head,&tail,value);
}
Print(headPtr);

return 0;
}

void EnQueue(QueueList *head,QueueList *tail,int value)
{
QueueList new;

if((new=(QueueList)malloc(sizeof(QNode)))==NULL)
{
exit(1);
}
newPtr->data=value;
newPtr->next=NULL;
if(*head==NULL)
{
new->next=*head;
*head=new;
}
else
(*tail)->next=new;
*tail=new;
}

void Print(QueueList head)
{
while(head)
{
printf("%d->",head->data);
head=head->next;
}
printf("null\n\n");
}

仔细对照(完全按你的思路改的),你是男女?是女的我下次就不回答了
[CODE]

#include<stdio.h>
#include<stdlib.h>
typedef struct QNOde {
int data;
struct QNOde *next;
}QNode,*QueueList;

void EnQueue(QueueList *head,QueueList *tail,int value);
void Print(QueueList head);

int main()
{
QueueList head=NULL,tail=NULL;
int i,n,value;

printf("Please input node n: ");
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&value);
EnQueue(&head,&tail,value);
}
Print(head);
getch();
return 0;
}

void EnQueue(QueueList *head,QueueList *tail,int value)
{
QueueList newPtr;

if( (newPtr =(QueueList)malloc(sizeof(QNode)))==NULL )
{
exit(1);
}
newPtr->data=value;
newPtr->next=NULL;
if(*head==NULL)
{
newPtr->next=*head;
*tail=*head=newPtr; /*首尾要有联系*/
}
else
{
(*tail)->next=newPtr;
*tail=newPtr;
}
}

void Print(QueueList head)
{
while(head)
{
printf("%d->",head->data);
head=head->next;
}
printf("null\n\n");
}

[/CODE]

[此贴子已经被作者于2006-3-30 15:31:34编辑过]

楼主的名字挺有意思，和慈喜一个姓氏，我是驽尔哈赤；

1。首先说二楼的程序有问题，好好看看，函数无返回值，你返回了。
2。楼主的程序错误很简单，new是C++中的关键字，你肯定用的是VC，只要把new该成newPtr就可以了，VC情况下用错new关键字，将会出现102条错误信息。

以上是我的分析，正确与否，请指教

楼主很多细小错误,而且使用了关键字.一会new 一会 newPtr

最主要问题是首尾失去联系

楼主的程序没有失去联系，下面是我帮楼主改的：
#include<stdio.h>
#include<stdlib.h>
typedef struct QNOde{
char data;
struct QNOde *next;
}QNode,*QueueList;

void EnQueue(QueueList &headPtr,QueueList &tailPtr,char ch);
void Print(QueueList headPtr);

int main()
{
QueueList headPtr=NULL,tailPtr=NULL;
char ch;
int i,n;

printf("Please input node number: ");
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf(" %c",&ch);
EnQueue(headPtr,tailPtr,ch);
}
Print(headPtr);

return 0;
}

void EnQueue(QueueList &headPtr,QueueList &tailPtr,char ch)
{
QueueList newPtr;

if((newPtr=(QueueList)malloc(sizeof(QNode)))==NULL)
{
exit(1);
}
newPtr->data=ch;
newPtr->next=NULL;
if(headPtr==NULL)
{
newPtr->next=headPtr;
headPtr=newPtr;
}
else
tailPtr->next=newPtr;
tailPtr=newPtr;
}

void Print(QueueList headPtr)
{
while(headPtr)
{
printf("%c->",headPtr->data);
headPtr=headPtr->next;
}
printf("null\n");
}
请指教

我加了个{} 把楼主意思曲解了
不过楼上程序也不对

忘记说了，以上程序用VC，TC可能出错，我用的引用方式

这在C里是不允许的 ,当然C++可以

谢谢楼上两位高人帮助

//无头结点的单链表基本操作
#include<stdio.h>
#include<stdlib.h>
typedef struct QNode
{
int data;
struct QNode *next;
}QNode,*QueueList;

void EnQueue(QueueList *head,QueueList *tail,int value);
void Print(QueueList head);

int main()
{
QueueList head=NULL,tail=NULL;
int i,n,value;

printf("Please input node n: ");
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&value);//输入数据元素
EnQueue(&head,&tail,value);//输入无头结点单链表
}
Print(head);//打印

return 0;
}

void EnQueue(QueueList *head,QueueList *tail,int value)
{//输入无头结点单链表
QueueList newbase;

if((newbase=(QueueList)malloc(sizeof(QNode)))==NULL)
exit(1);//新建头结点并判断是否建立成功
newbase->data=value;
newbase->next=NULL;
if(*head==NULL)
{

newbase->next=*head;
*head=newbase;
}
else
(*tail)->next=newbase;
*tail=newbase;
}

void Print(QueueList head)
{//打印
while(head)
{
printf("%d->",head->data);
head=head->next;
}
printf("null\n\n");
}