Description
构造二叉链表表示的二叉树:按先序次序输入二叉树中结点的值(一个字符),’#'字符表示空树,构造二叉链表表示的二叉树T,并求此二叉树中不同度的结点数量
#include "stdio.h"
#include "malloc.h"
#define TRUE 1
#define FALSE 0
#define OK 1
#define ERROR 0
#define INFEASIBLE -1
#define OVERFLOW -2
typedef int Status;
int n1,n2,n0;
typedef char ElemType;
typedef struct BiTNode{
ElemType data;
struct BiTNode *lchild,*rchild;
}BiTNode,*BiTree;
//构造一棵二叉树
Status CreateBiTree(BiTree &T)
{
char ch;
scanf("%c",&ch);
if(ch=='#') T=NULL;
else{
T=(BiTree)malloc(sizeof(BiTree));
if(!T) return ERROR;
T->data=ch;
CreateBiTree(T->lchild);
CreateBiTree(T->rchild);
}
return OK;
}
void Traversal(BiTree T)
{
if(T)
{
//int type;
if(!T->lchild && !T->rchild)
n0++;
else if(T->lchild!=NULL && T->rchild!=NULL)
n2++;
else n1++;
Traversal(T->lchild);
Traversal(T->rchild);
}
}
int main()
{
BiTree T;
//int n1,n2,n0;
CreateBiTree(T); //创建一棵二叉树
Traversal(T); //遍历并计算各种结点的个数
//输出各种结点的数量
printf("%d\n",n2);
printf("%d\n",n1);
printf("%d\n",n0);
return 0;
}