二叉树的各种遍历的实现(程序已测试)(共3页).doc

精选优质文档-倾情为你奉上#include#include#include #define TRUE 1 #define FALSE 0 #define OK 1 #define ERROR 0 #define OVERFLOW -2 typedef char TElemType; typedef int Status; typedef struct BiTNode TElemType data; BiTNode *lchild,*rchild; / 左右孩子指针 BiTNode,*BiTree; typedef BiTree QElemType; #includeLinkQueue.h void Visit(TElemType e) printf(%c,e); void CreateBiTree(BiTree &T) / 算法6.4：按先序次序输入二叉树中结点的值