BTree.h:
- #include “DS.h”
- typedef char ElemType;
- typedef struct BiTNode {
- ElemType data;
- struct BiTNode *lchild,*rchild;
- }BiTNode,*BiTree;
- typedef struct QueueNode{
- BiTree data;
- struct QueueNode *next;
- }QueueNode,*QueuePtr;
- typedef struct {
- QueuePtr front;
- QueuePtr rear;
- }LinkQueue;
- void menu();
- void CreateBiTree(BiTree &T);
- void PreOrderTraverse(BiTree T);
- void InOrderTraverse(BiTree T);
- void PostOrderTraverse(BiTree T);
- void leverOrderTraverse(BiTree T);
- Status InitQueue(LinkQueue *Q);
- Status IsEmptyQueue(LinkQueue Q);
- Status EnQueue(LinkQueue *Q,BiTree m);
- BiTree DeQueue(LinkQueue *Q);
BTree.cpp:
- #include “BTree.h”
- //菜单
- void menu(){
- printf(”\t\t\t 1、创建二叉树\n”);
- printf(”\t\t\t 2、前序遍历\n”);
- printf(”\t\t\t 3、中序遍历\n”);
- printf(”\t\t\t 4、后序遍历\n”);
- printf(”\t\t\t 5、层次遍历\n