数据结构二叉树程序.docxVIP

#includestdio.h #includestdlib.h #define QueueMaxSize 20 #define StackMaxSize 10 typedef char ElemType; struct BTreeNode { ElemType data; struct BTreeNode* left; struct BTreeNode* right; }; /* 前序遍历 */ void Preorder(struct BTreeNode * BT) { if(BT!=NULL) { printf(%c ,BT-data); Preorder(BT-left); Preorder(BT-right); } } /* 中序遍历 */ void Inorder(struct BTreeNode * BT) { if(BT!=NULL) { Inorder(BT-left); printf(%c ,BT-data); Inorder(BT-right); } } /* 后序遍历 */ void Postorder(struct BTreeNode * BT) { if(BT!=NULL) { Postorder(BT-left); Postorder(BT-right); printf(%c ,BT-data); } } /* 按层遍历 */ void Levelo