![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
数据结构
si_yu_ge
任逍遥
展开
-
顺序栈的基本操作
//constant.h#define OK 1#define ERROR 0#define OVERFLOW -2#define TURE 1#define FALSE 0 typedef int Status;//SqStack.h#define STACK_INIT_SIZE 10#define STACK_INCREMENT 5struct SqStack{ SElemType *base; SElemType *top; int stacksize;};//顺序栈原创 2020-10-15 20:28:50 · 116 阅读 · 0 评论 -
单链表的基本操作
//LinkList.htypedef int ElemType;typedef struct LNode{ ElemType data; struct LNode *next;}LNode, *LinkList;//LinkList_Operation.cppusing namespace std;// 1 单链表的初始化 Status InitList(LinkList &L){ L = new LNode; L->next == NULL; return OK;原创 2020-10-14 20:41:59 · 70 阅读 · 0 评论