卑微的自我的博客

实现二叉树的遍历；二叉排序树的生成插入删除

#include<stdio.h>#include<stdlib.h>#include<string.h>#define MaxSize 255typedef struct { char ch[MaxSize]; int length;}String;void StrAssign(String& S,char a[]) { S.length=strlen(a); for (int i = 0; i < S.length; i++) {

#include<stdio.h>#include<stdlib.h>typedef int ElemType;typedef struct LinkNode{ ElemType data; struct LinkNode *next;}LinkNode;typedef struct LinkQueue { LinkNode *front, *rear;}LinkQueue;void InitQueue(LinkQueue &Q) { Q.fro

#include<stdio.h>#define MaxSize 20typedef int ElemType;typedef struct{ ElemType data[MaxSize]; int front, rear,size;}SqQueue;bool InitQueue(SqQueue &S) { S.size = 0; S.front = 0; S.rear = 0; return true;}bool EnQueue(SqQueue &a

#include<stdio.h>#include<stdlib.h>typedef int ElemType;typedef struct Linknode { ElemType data; struct Linknode* next;}Linknode, *LiStack;bool InitStack(LiStack &L) { L = (Linknode *)malloc(sizeof(Linknode)); L->data = NULL;

#include<stdio.h>#define MaxSize 20typedef int ElemType;typedef struct { ElemType data[MaxSize]; int top;}SqStack;void InitSqStack(SqStack& S) { S.top = -1;}bool Push(SqStack& S,ElemType e) { if (S.top == MaxSize - 1) return f

#include<stdio.h>#include<stdlib.h>#define MaxSize 100typedef int ElemType;typedef struct LNode { ElemType data; struct LNode * next;}LNode ,*LinkeList ;bool InitLIst(LinkeList& L) { L = (LNode*)malloc(sizeof(LNode)); if (L =

#include<stdio.h>#include<stdlib.h>#define MaxSize 100#define ok 1#define error -1#define overflow -2typedef int ElemType;typedef struct { ElemType *data; int length;}SeqList;int InitList(SeqList &L){ L.data = new ElemType[Ma