15数据结构—树的递归遍历求叶子结点

思路：

通过传入根节点，遍历左右节点树，当左右节点树都为空（NULL）时的次数和即为二叉树的叶子结点。递归条件：传入的根节点不为空。即if(root==NULL) return;

以下图为例：

 代码实现：

#include <iostream>
using namespace std;
typedef struct My_tree {
	char data;
	struct My_tree* lson;
	struct My_tree* rson;
}mytree;
void leaf_tree(mytree* root,int *num);
//创建二叉树
void Create_tree() {
	mytree node1 = { 'A',NULL,NULL };
	mytree node2 = { 'B',NULL,NULL };
	mytree node3 = { 'C',NULL,NULL };
	mytree node4 = { 'D',NULL,NULL };
	mytree node5 = { 'E',NULL,NULL };
	mytree node6 = { 'F',NULL,NULL };
	mytree node7 = { 'G',NULL,NULL };
	mytree node8 = { 'H',NULL,NULL };
	node1.lson = &node2;
	node1.rson = &node6;
	node2.rson = &node3;
	node3.lson = &node4;
	node3.rson = &node5;
	node6.rson = &node7;
	node7.lson = &node8;
	int leaf_num = 0;
	leaf_tree(&node1, &leaf_num);
	cout<<"树叶子结点的数目："<<leaf_num<<endl;
	
}
void leaf_tree(mytree* root, int* num) {
	if (root == NULL) {
		return;
	}
	if (root->lson == NULL&& root->rson==NULL) {
		(*num)++;
	}
	
	leaf_tree(root->lson,num);
	leaf_tree(root->rson,num);
}

int main() {
	Create_tree();
	
	return 0;
}

运行效果：