jiaojiao3701的博客

二叉树度数为0，1，2，所对应的结点个数 #include<stdio.h> #include<stdlib.h> #include<malloc.h> typedef struct node{ char data; struct node *Lchild; struct node *rchild; }BiTnode; //建立二叉树 BiTnode *Create_Tree(){ char ch; BiTnode *root; scanf("%c",&amp

#include<stdio.h> #include<stdlib.h> #include<malloc.h> typedef struct node{ char data; struct node *Lchild; struct node *rchild; }BiTnode; //统计结点总数 int count1=0; //统计叶子结点数目的全局变量 int count2=0; //统计层数 int depth=0; //先序建立二叉树 BiTnode *Cre

二叉树 #include<stdio.h> #include<stdlib.h> #include<malloc.h> typedef struct Tree{ struct Tree *left,*right; int weight; }Tree; //创建二叉树并插入数据 Tree *creatTree(int data){ Tree *t=(Tree *)malloc(sizeof(Tree)); t->weight=data; t->lef