order.cpp

来自「用C实现的二叉树遍历」· C++ 代码 · 共 54 行

#include "commond.h"
typedef char TElemType;
typedef struct BiTNode{
	TElemType data;
	struct BiTNode *lchild,*rchild;
}BiTNode,*BiTree;
Status CreaBiTree(BiTree &T)
{TElemType ch;
 scanf("%c",&ch);
 if(ch==' ')
	 T=NULL;
 else{
	 T=(BiTNode*)malloc(sizeof(BiTNode));
	 T->data=ch;
     CreaBiTree(T->lchild);
	 CreaBiTree(T->rchild);
 }
 return OK;
}
void visit(TElemType e)
{printf("%c",e);
}
void PreOrder(BiTree T)
{if(T){
	visit(T->data);
	PreOrder(T->lchild);
	PreOrder(T->rchild);
}
}
void InOrder(BiTree T)
{if(T){
    InOrder(T->lchild);
	visit(T->data);
	InOrder(T->rchild);
}
}
void PostOrder(BiTree T)
{if(T){
	PostOrder(T->lchild);
	PostOrder(T->rchild);
	visit(T->data);
}
}
void main()
{BiTree T;
 CreaBiTree(T);
 PreOrder(T);
 InOrder(T);
 PostOrder(T);
}