Warren's Blog

#include<stdio.h> #include<malloc.h> #include<stdlib.h> //----------------------------------------------------常定义// #define TRUE 1 #define FALSE 0 #define OK 1 #define ERROR 0 #define OVERFLOW

typedef int SElemType; typedef struct LNode { SElemType *base;//栈底地址 SElemType *top;//栈顶地址 int stacksize; //可用的最大容量 }SqStack;bool InitStack(SqStack &S) { S.base = new SElemType[MAXSIZE]

typedef int SElemType; typedef struct StackNode { SElemType data; StackNode *next; }StackNode,*LinkStack; bool InitStack(LinkStack &S) {//栈的初始化 S = NULL;//要注意栈没有头结点 return OK; }bool Pus

#pragma comment(linker, "/STACK:102400000,102400000")//手动开大栈区

typedef int QElemType; typedef struct QNode { QElemType data; QNode *next; }QNode,*QueuePtr; typedef struct { QueuePtr Front;//队首指针 QueuePtr Rear;//队尾指针 }LinkQueue;//是一个指针表bool InitQueu

define ERROR 0define OK 1#define MAXQSIZE 200 //!注意栈是没有头结点的 typedef int QElemType; typedef struct { QElemType *base; int Front; int Rear; }SqQueue;bool InitQueue(SqQueue &Q) {//队列的初始化

void InOrderTraverse(BiTree T) {//中序遍历二叉树T的递归算法 if(T) { InOrderTraverse(T->Lchild); cout<<T->data<<endl; InOrderTraverse(T->Rchild); } }void InOrderTraverse_Un(BiTre

//顺序表 注意元素数据才是表 length只是记录 #include <cstdio> #include <stdlib.h> #define MAXSIZE 20 #define Ok 1 #define Error 0 #define OVERFLOW -2typedef int ElemType; typedef int Status; typedef struct {

typedef int Elemtype; typedef struct LNode { Elemtype data; LNode *next; }LNode,*LinkList; void InitList(LinkList &L) {//初始化 L = new LNode; L->next = NULL; }bool GetElem(LinkList &L,int