二叉树递归遍历.h

数据结构课程设计的题目

//前序遍历
void PreOrder(BiTreeNode *curr)
{
     if(curr==NULL)return ;
     Visit(curr->data);
     PreOrder(curr->leftchild);
     PreOrder(curr->rightchild);
}
//中序遍历 
void InOrder(BiTreeNode *curr)
{
     if(curr==NULL)return;
     InOrder(curr->leftchild);
     Visit(curr->data);
     InOrder(curr->rightchild);
}
//后序遍历 
void PostOrder(BiTreeNode *curr)
{
     if(curr==NULL)
     return;
     PostOrder(curr->leftchild);
     PostOrder(curr->rightchild);
     Visit(curr->data);
}