二叉树——求叶子结点树

最新推荐文章于 2024-05-29 12:00:00 发布

一枚高职老师自学之路

最新推荐文章于 2024-05-29 12:00:00 发布

阅读量745

点赞数

文章标签： c++ c语言算法

本文链接：https://blog.csdn.net/cyn227/article/details/130476320

版权

在这里插入图片描述
明显有3个叶子结点

求叶子结点数的函数

//求叶子结点数函数
void CaculateLeafNum(BinaryNode* root,int* leafNum){
	if (root == NULL)
	{
		return;
	}
	if (root->lchild == NULL && root->rchild == NULL)
	{
		(*leafNum)++;
	}
	//左子树叶子结点的数目
	CaculateLeafNum(root->lchild,leafNum);
	//右子树叶子结点的数目
	CaculateLeafNum(root->rchild,leafNum);
}

main.c

#define _CRT_SECURE_NO_WARNINGS
#include <stdlib.h>
#include <stdio.h>
#include <string.h>

//二叉树结点
typedef struct BINARYNODE {
	char ch;
	struct BINARYNODE* lchild;
	struct BINARYNODE* rchild;
}BinaryNode;

//求叶子结点数函数
void CaculateLeafNum(BinaryNode* root,int* leafNum){
	if (root == NULL)
	{
		return;
	}
	if (root->lchild == NULL && root->rchild == NULL)
	{
		(*leafNum)++;
	}
	//左子树叶子结点的数目
	CaculateLeafNum(root->lchild,leafNum);
	//右子树叶子结点的数目
	CaculateLeafNum(root->rchild,leafNum);
}

//构造二叉树
void CreatBinaryNode() {
	//创建结点
	BinaryNode node1 = { 'A',NULL,NULL };
	BinaryNode node2 = { 'B',NULL,NULL };
	BinaryNode node3 = { 'C',NULL,NULL };
	BinaryNode node4 = { 'D',NULL,NULL };
	BinaryNode node5 = { 'E',NULL,NULL };
	BinaryNode node6 = { 'F',NULL,NULL };
	BinaryNode node7 = { 'G',NULL,NULL };
	BinaryNode node8 = { 'H',NULL,NULL };

	//建立结点关系
	node1.lchild = &node2;
	node1.rchild = &node6;
	node2.rchild = &node3;
	node3.lchild = &node4;
	node3.rchild = &node5;
	node6.rchild = &node7;
	node7.lchild = &node8;

	int leafNum = 0;
	CaculateLeafNum(&node1, &leafNum);
	printf("叶子结点的数目：%d\n", leafNum);
}

int main(void)
{
	CreatBinaryNode();

	printf("\n");
	system("pause");
	return 0;
}