Question

二叉树怎么写层序遍历

#include<stdio.h>
#include<stdlib.h>
#include<stack>
typedef struct BiTNode{
char data;
struct BiTNode *lchild;
struct BiTNode *rchild;
}BiTNode,*BiTree;
void CreatBiTree(BiTree &Tree)
{
char a;
a=getchar();
if(a=='#')
Tree=NULL;
else
{
Tree=(BiTree)malloc(sizeof(BiTNode));
Tree->data=a;
CreatBiTree(Tree->lchild);
CreatBiTree(Tree->rchild);
}
}
void PreOrderTraverse(BiTree Tree)
{
if(Tree!=NULL)
{printf("%4c",Tree->data);
PreOrderTraverse(Tree->lchild);
PreOrderTraverse(Tree->rchild);

}
}
void midorder(BiTree Tree)
{
if(Tree!=NULL)
{
midorder(Tree->lchild);
printf("%4c",Tree->data);
midorder(Tree->rchild);
}

}
void behindorder(BiTree Tree)
{
if(Tree!=NULL)
{
behindorder(Tree->lchild);
behindorder(Tree->rchild);
printf("%4c",Tree->data);

}
}
int Leaf(BiTree Tree)
{
if(Tree==NULL) return 0;
else if(!Tree->lchild&&!Tree->rchild) return 1;
else return (Leaf(Tree->lchild)+Leaf(Tree->rchild));
}
int NodeCount(BiTree Tree)
{
if(Tree==NULL) return 0;
else return (NodeCount(Tree->lchild)+NodeCount(Tree->rchild)+1);
}
在这个程序中加入二叉树的层序遍历，实在做不来层序遍历

Answer 1

二叉树的层序遍历，可以用队列来实现