实现二叉树先序遍历、中序遍历、后序遍历等运算.doc

内容：实现教材中二叉树的链接表示。 实现二叉树先序遍历、中序遍历、后序遍历等运算。 （参考教材6.2） (2) 实现计算二叉树叶子结点和交换二叉树中所有结点左右子树的运算。 typedef struct btnode { int Element; struct btnode* Lchild, *Rchild; }BTNode; typedef struct btree{ struct btnode* Root; }BTree; void CreateBT(BTree * Bt) { Bt-Root=NULL; } BTNode* NewNode( ) { BTNode* p=(BTNode*)malloc(sizeof(BTNode)); if (IS_FULL(p)){ printf(The memory is full\n); exit(1); } return p; } void MakeBT(BTree* Bt, int x, BTree *Lt, BTree *Rt) { BTNode* p＝NewNode(); p-Element=x; p-Lchild=Lt-Root; p-Rchild=Rt-Root; Lt-Root=Rt-Root=NULL; Bt-Root=p; } void calculate( BTNode *t) //计算叶子结点 { static int i=0; if((t-Lchild==NULL)(t-Rchild==NULL)) i++; } void swapbitree(BTNode *bt) //jiaohuan zuoyou { BTNode *p; if(bt==0) return ; swapbitree(bt-Lchild); swapbitree(bt-Rchild); p=bt-Lchild; bt-Lchild=bt-Rchild; bt-Rchild=p; } void PreOrd(void (*Visit)(BTNode * u), BTNode *t) //先序 { if (t) { (*Visit)(t); PreOrd(Visit, t-Lchild); PreOrd(Visit, t-Rchild); } calculate( t); } void PreOrder(BTree Bt, void (*Visit)(BTNode* u)) { PreOrd(Visit, Bt.Root); } void InOrd(void (*Visit)(BTNode * u), BTNode *t) //中序 { if (t){ InOrd(Visit, t-Lchild); (*Visit)(t); InOrd(Visit, t-Rchild); } } void InOrder(BTree Bt, void (*Visit)(BTNode *u)) { InOrd(Visit, Bt.Root); } void PostOrd(void (*Visit)(BTNode * u), BTNode*t) //后序 { if (t){ PostOrd(Visit, t-Lchild); PostOrd(Visit, t-Rchild); (*Visit)(t); } } void PostOrder(BTree Bt, void (*Visit)(BTNode* u)) { PostOrd(Visit, Bt.Root); } void main(void) { BTree a, x, y, z; int e; CreateBT(a); CreateBT(x); CreateBT(y); CreateBT(z); MakeBT(y, E, a, a); MakeBT(z, F, a, a); MakeBT(x, C, y, z); MakeBT(y, D, a, a); MakeBT(z, B, y, x) printf(叶子结点\t); printf(%d,i); }