下面这段代码更具用户输入建立二叉树,并且可以把每一个节点所在的层数打印出来。
#include<stdio.h>
#include "malloc.h"
#include "windows.h"
typedef char Elemtype;
typedef struct BiTNode
{
char data;
struct BiTNode *lchild,*rchild;
}BiTNode,*BitTree;
//创建一颗二叉树
void CreateBitTree(BitTree *T)
{
char c;
scanf("%c",&c);
if(' '==c)
{
*T=NULL;
}
else
{
*T=(BiTNode *)malloc(sizeof(BiTNode));
(*T)->data=c;
CreateBitTree(&(*T)->lchild);
CreateBitTree(&(*T)->rchild);
}
}
void visit(char c,int level)
{
printf("%c位于%d层\n",c,level);
}
//遍历二叉树
void PreOrderTraverse(BitTree T,int level)
{
if(T)
{
visit(T->data,level);
PreOrderTraverse(T->lchild,level+1);
PreOrderTraverse(T->rchild,level+1);
}
}
int main()
{
int level=1;
BitTree T=NULL;
CreateBitTree(&T);
PreOrderTraverse(T,level);
system("pause");
return 0;
}
接下来说明线索二叉树
j