怎么输出每个结点的层次
追答//增加个变量i,修改一下PreOrderTraverse
#include
#include
#include
#define TRUE 1
#define FALSE 0
#define OK 1
#define ERROR 0
#define INFEASIBLE -1
#define OVERFLOW -2
typedef int Status;
typedef char elemtype;
typedef struct BiTNode{
elemtype data;
struct BiTNode *lchild,*rchild;
}BiTNode,*BiTree;
//构造二叉树
Status CreateBiTree(BiTree &T){
elemtype ch;
ch=getchar();
if(ch==' '){T=NULL;}
else{
if(!(T=(BiTNode *)malloc(sizeof(BiTNode))))
return FALSE;
T->data=ch;
CreateBiTree(T->lchild);
CreateBiTree(T->rchild);
}
return OK;
}
// 先序遍历
void PreOrderTraverse(BiTree T,int i)
{
if(T!=NULL)
{
printf("%c\t%d\n",T->data,i);
PreOrderTraverse(T->lchild,i+1);
PreOrderTraverse(T->rchild,i+1);
}
}
//叶子节点的个数
Status Leafnumber(BiTree T){
int num1=0,num2=0;
if(T==NULL)
return 0;
else if (T->lchild==NULL&&T->rchild==NULL) return 1;
else
{
num1=Leafnumber(T->lchild);
num2=Leafnumber(T->rchild);
return(num1+num2);
}
}
//树的深度
Status DepthTree(BiTree T)
{
int llength=0,rlength=0;
if(T==NULL) return 0;
else
{
llength=DepthTree(T->lchild);
rlength=DepthTree(T->rchild);
return(llength>rlength)?(llength+1):(rlength+1);
}
}
void main()
{
BiTree s;
int i=1;
printf("输入字符串,使用空格代表空\n");
CreateBiTree(s);
printf("先序输出:\n值\t层次\n");
PreOrderTraverse(s,i);
printf("\n树的深度:%d\n",DepthTree(s));
getch();
}