資料結構的順序棧 鏈式棧 鏈佇列 迴圈佇列的實現

#include

#include

#include

#define maxqsize 5

# define overflow 0

#define ok 1

# define stack_init_size 100

#define stackincrement 10

typedef int selemtype;

typedef int status;

using namespace std;

typedef struct sqstack;

//構造空棧

status initstack(sqstack &s)

//棧的初始化

int input(sqstack &s,int n)

//棧的遍歷

status otput(sqstack s,int n)

//入棧操作

status push(sqstack &s,selemtype e)

*s.top++=e;

return ok;

}//出棧

status pop(sqstack &s,selemtype &e)

//鏈式棧

typedef int lelemtype;

typedef struct lnodelnode,*linkstack;

//建立鍊錶

status createstack(linkstack &s,int n)

return ok;

}//列印建立的鏈棧

status disp(linkstack s)

cout}//鏈入棧

status linkstackpush(linkstack &s,lelemtype e)

//鏈出棧

status linkstackpop(linkstack &s,lelemtype &e)

return ok;

}//鏈佇列

typedef int qelemtype;

typedef struct qnodeqnode,*queueptr;

typedef structlinkqueue;

//建立鏈佇列

status initqueue(linkqueue &q,int n)

return ok;

}//列印鏈隊

status out(linkqueue q)while(p!=q.rear);

return ok;

}//插入鏈隊

status queuepush(linkqueue &q,qelemtype e)

status queuepop(linkqueue &q,qelemtype &e)

//迴圈佇列

typedef int qelemtype;

typedef structsqqueue;

//構建空迴圈佇列