栈
MyDreamingCode
Life is not a bed of roses.
展开
-
后序非递归遍历二叉树(用栈来实现)
#include<stdio.h> #include<stdlib.h> #define MaxSize 50 typedef char ElemType; typedef struct BTNode { ElemType data; struct BTNode *left; struct BTNode *right; }BTNode,*BiTree; typedef struct Stack { BTNode *data[MaxSize]; int tagArr[.原创 2021-11-16 23:54:03 · 828 阅读 · 0 评论 -
先序非递归遍历二叉树(用栈来实现)
#include<stdio.h> #include<stdlib.h> #define MaxSize 50 typedef char ElemType; typedef struct BTNode { ElemType data; struct BTNode *left; struct BTNode *right; }BTNode,*BiTree; typedef struct Stack { BTNode *data[MaxSize]; int top; }S.原创 2021-11-16 21:25:51 · 592 阅读 · 0 评论 -
中序非递归遍历二叉树(用栈来实现)
#include<stdio.h> #include<stdlib.h> #define MaxSize 50 typedef char ElemType; typedef struct BTNode { ElemType data; struct BTNode *left; struct BTNode *right; }BTNode,*BiTree; typedef struct Stack { BTNode *data[MaxSize]; int top; }S.原创 2021-11-16 21:10:44 · 965 阅读 · 0 评论 -
栈在括号匹配中的应用
#include<stdio.h> #define MaxSize 10 typedef char ElemType; typedef struct{ ElemType data[MaxSize]; int top; }SqStack; void InitStack(SqStack &S) { S.top = -1; } bool Push(SqStack &S,ElemType x) { if(S.top==MaxSize-1) return false; .原创 2021-09-14 07:19:47 · 38 阅读 · 0 评论 -
判断字符串是否对称
/*设单链表的表头指针为L,结点结构由data、next两个域构成,其中data域为字符型。试设计算法判断该链表 的全部n个字符是否中心对称。例如xyx、xyyx都是中心对称。*/ #include<stdio.h> #include<stdlib.h> #define MaxSize 50 typedef char ElemType; typedef struct LNode{ ElemType data; struct LNode *next; }LNode,*LinkLi.原创 2021-09-12 07:00:03 · 1083 阅读 · 0 评论 -
链栈的基本操作
#include<stdio.h> #include<stdlib.h> typedef int ElemType; typedef struct StNode{ ElemType data; struct StNode *next; }StNode,*LinkSt; //初始化栈 void InitStack(LinkSt &S) { S = NULL; } //判断栈空 bool StackEmpty(LinkSt S) { if(!S) return .原创 2021-09-12 06:59:53 · 65 阅读 · 0 评论 -
顺序栈的基本操作
#include<stdio.h> #define MaxSize 50 typedef int ElemType; typedef struct{ ElemType data[MaxSize]; int top; }SqStack; //初始化栈 void InitStack(SqStack &S) { S.top = -1; } //判断栈空 bool StackEmpty(SqStack S) { if(S.top == -1) return true; els.原创 2021-09-12 06:59:43 · 71 阅读 · 0 评论