#include <stdio.h>
#include <stdlib.h>
typedef char TElemType;
typedef struct BiTNode
{
TElemType data;
struct BiTNode *lchild,*rchild;
}BiTNode, *BiTree;
void CreateBiTree(BiTree *T)
{
//按先序次序输入二叉树中结点的值，#代表空树
char ch;
scanf("%c",&ch);
if(‘#‘ == ch)
{
*T=NULL;
}
else
{
*T =(BiTNode *)malloc(sizeof(BiTNode));
(*T)->data =ch;
CreateBiTree(&(*T)->lchild);
CreateBiTree(&(*T)->rchild);
}
}
void PrintElement(TElemType e)
{
printf("%c",e);
}
void PreOrderTraverse(BiTree T,void (*visit)(TElemType e))
{
//线序遍历二叉树T的递归算法，对每个元素调用visit方法
if(T)
{
visit(T->data);
PreOrderTraverse(T->lchild, visit);
PreOrderTraverse(T->rchild, visit);
}
}
void InOrderTraverse(BiTree T,void (*visit)(TElemType e))
{
if(T)
{
InOrderTraverse(T->lchild, visit);
visit(T->data);
InOrderTraverse(T->rchild, visit);
}
}
void PostOrderTraverse(BiTree T,void (*visit)(TElemType e))
{
if(T)
{
PostOrderTraverse(T->lchild, visit);
PostOrderTraverse(T->rchild, visit);
visit(T->data);
}
}
int main(void)
{
BiTree T=NULL;
CreateBiTree(&T);
printf("先序遍历：");
PreOrderTraverse(T, PrintElement);
printf("中序遍历：");
InOrderTraverse(T,PrintElement);
printf("后序遍历：");
PostOrderTraverse(T,PrintElement);
}
二叉树遍历
原文：http://blog.csdn.net/codebat/article/details/40825393
