C语言二叉数输入,创建,输出,求节点,求叶子节点,求高度在这里插入代码片`#include <stdio.h>
#include <malloc.h>
typedef char DataType;
typedef struct bnode{
DataType data;
struct bnode *lchild,*rchild;
}Bnode,*BTree;
BTree CreateBinTree()
{
BTree t;
char ch;
ch=getchar();
if(ch==’#’) t=NULL;
else
{
t=(BTree)malloc(sizeof(Bnode));
t->data=ch;
t->lchild=CreateBinTree();
t->rchild=CreateBinTree();
}
return t;
}
void Visit(char ch)
{
printf("%2c",ch);
}
int Height(BTree t)
{
if(t==NULL)
return 0;
else{
int h1,h2;
h1=Height(t->lchild);
h2=Height(t->rchild);
if(h1>h2)
return h1+1;//加的是根节点
else
return h2+1;
}
}
int c=0,a=0;
void PreOrder(BTree t)
{
if(t)
{ c++;
if(t->rchildNULL&&t->lchildNULL)
a++;
PreOrder(t->lchild);
Visit(t->data);
PreOrder(t->rchild);
}
}
void main()
{int h;
BTree t=CreateBinTree();
PreOrder(t);
printf("\n二叉树结点数:%d\n二叉树叶子结点数:%d",c,a);
printf("\n");
h=Height(t);
printf(“树的高度是:%d\n”,h);
}
`