#include <stdlib.h>
#include <stdio.h>
#define ElemType char
typedef struct binNode{
ElemType data;
struct binNode *left,*right;
}BinNode,*BinTree;
char *arry="ab##ce##f##";
int i=0;
//按照先序创建一颗树
void create(BinTree *t){
ElemType ch;
ch=arry[i];
i++;
if ('#'==ch) {
*t=NULL;
}else{
*t=(BinTree)malloc(sizeof(BinNode));
(*t)->data=ch;
create(&(*t)->left);
create(&(*t)->right);
}
}
void add(BinTree t,ElemType data){
}
//销毁树
void destoryTree(BinTree t){
if (t) {
destoryTree(t->left);
destoryTree(t->right);
free(t);
}
}
//打印所有个叶子节点
void lefPrintf(BinTree t){
if (t==NULL) {
return;
}
if (t->right==NULL&&t->left==NULL) {
printf("叶子节点-%c\n",t->data);
}
lefPrintf(t->left);
lefPrintf(t->right);
}
//查找叶子节点的个数
int countLef(BinTree t){
if (t==NULL) {
return 0;
}
if (t->right==NULL&&t->left==NULL) {
return 1;
}
return countLef(t->left)+countLef(t->right);
}
//求叶子的深度
int TreeHeight(BinTree t){
int num=0;
if (t) {
int l=TreeHeight(t->left);
int r=TreeHeight(t->right);
num=1+(r>l?r:l);
}
return num;
}
//查找节点
BinNode* findNode(BinTree t,ElemType c){
BinNode* p;
if (t==NULL) {
return NULL;
}
if (t->data==c) {
return t;
}else{
if ((p=findNode(t->left, c))!=NULL) {
return p;
}else{
return findNode(t->right,c);
}
}
}
//先序遍历
void inOrder(BinTree t){
if (t) {
printf("%c\n",t->data);
inOrder(t->left);
inOrder(t->right);
}
}
int main(){
BinTree t;
create(&t);
inOrder(t);
int sum=countLef(t);
printf("叶子的个数=%d\n",sum);
lefPrintf(t);
int heigth=TreeHeight(t);
printf("深度=%d\n",heigth);
BinNode* nodeT=findNode(t,'e');
printf("查找的节点数据是=%c\n",nodeT->data);
destoryTree(t);
return 0;
}
C/c++数据结构 二叉树的常用方法
最新推荐文章于 2018-08-24 17:58:00 发布