数据结构杨辉三角.doc

文档介绍：/*数据结构工程编程:杨辉三角*/
//链队列
#define OK 1
#define error 0
#define maxsize 100
#include ""
#include ""
typedef int status;
//#include ""
//#include ""
typedef int Qelemtype;
typedef struct{
Qelemtype *base;
int f;
int r;
}Squeue;
//构造空队列
status InitQueue(Squeue & Q);
//求队列的长度
int Queuelength(Squeue & Q);
//把e插入队列(插入在队尾进行)
status EnQueue(Squeue & Q,Qelemtype e);
//删除元素(删除在对头进行)
status DeQueue(Squeue & Q,Qelemtype &e);
//读取对头元素
int Gethead(Squeue Q,Qelemtype &e);
#include ""
//构造空队列
status InitQueue(Squeue & Q)
{
//=(Qelemtype*)malloc(maxsize*sizeof(Qelemtype));
=new(Qelemtype);
if(!)return error;
==0;
return OK;
}
//求队列的长度
int Queuelength(Squeue & Q)
{
//return (-+maxsize)%maxsize;
int k;
if(>)
k=-;
else
k=maxsize-(-);
return k;
}
//把e插入队列(插入在队尾进行)
status EnQueue(Squeue & Q,Qelemtype e)
{
if((+1)%maxsize==)
{
cout<<"队列已满"<<endl;
//return error;
}
[]=e;
=(+1)%maxsize;
return OK;
}
//删除元素(删除在对头进行)
status DeQueue(Squeue & Q,Qelemtype &e)
{
if(==)
{
cout<<"队列已空"<<endl;
return error;
}
e=[];
=(+1)%maxsize;
return OK;
}
//读取对头元素
int Gethead(Squeue Q,Qelemtype &e)
{
i