卑微的自我的博客

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

#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>#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>#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 =