在这里插入代码片
#include "stdio.h"
#include "malloc.h"
typedef struct node{
char data;
struct node *lchild,*rchild;
}Tree ,*btree;
void creat(btree *t){
char a;
scanf("%c",&a);
if(a==' '){
*t=NULL;
}else{
*t=(btree)malloc(sizeof(btree));
(*t)->data=a;
creat(&((*t)->lchild));
creat(&((*t)->rchild));
}
}
void display(btree t,int len){
if(t){
printf("%c位于第%d层\n",t->data,len);
qian(t->lchild,len+1);
qian(t->rchild,len+1);
}
}
int nodenum(btree t){
if(t==NULL){
return 0;
}else{
return nodenum(t->lchild)+nodenum(t->rchild)+1;
}
}
int main(){
btree t=NULL,t1;
int len=1,n;
creat(&t);
printf("二叉树:\n");
printf("输出:\n");
display(t,len);
printf("\n");
n=nodenum(t);
printf("二叉树节点个数:%d\n",n);
printf("\n");
return 0;
}