数据结构实验二链队

#include<iostream.h>
#include<stdlib.h>
struct Node
{int data;
Node *next;
};
class Stack
{private:
Node *front;
Node *rear;
public:
int array[100];
static int count;
Stack(){Node *s; s=(Node*)malloc(sizeof(Node));s->next=NULL;front=rear=s;}
void Insert(){Node *s; s=(Node*)malloc(sizeof(Node));int x;cout<<"请输入入队数据:";cin>>x;s->data=x;s->next=NULL;rear->next=s;rear=s;array[count+1]=s->data;count++;}//*入队*//
int Output(){Node *s; s=(Node*)malloc(sizeof(Node));int x;if(rear==front)cout<<"链队已空!"<<endl;s=front->next;x=s->data;front->next=s->next;if(s->next==NULL)rear=front;count--;delete s;return x;}//*出队*//
void Show(){for(int i=1;i<=count;i++)cout<<array[i]<<"  ";cout<<endl;}//*显示*//
};
int Stack::count=0;
int main()
{Stack S;void menu();
int i;
do
{cout<<"已入队数据数:";cout<<S.count<<endl;
menu();
cout<<"请输入你的选择:";cin>>i;
switch(i)
{case 1:S.Insert();break;
case 2:S.Output();break;
case 3:S.Show();break;
case 4:break;
default:cout<<"输入错误!请重新输入:";break;
}}while(i!=4);
return 0;
}
void menu()
{cout<<"1--入队;"<<endl;
cout<<"2--出队;"<<endl;
cout<<"3--显示;"<<endl;
cout<<"4--退出."<<endl;
}