二叉树编程实战

二叉树编程实战：

求叶子数目.c

#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
//二叉树结点
typedef struct BINARYNODE
{
   
        char ch;
        struct BINARYNODE*lchild;
        struct BINARYNODE*rchild;
}BinaryNode;
int num = 0;
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 CresteBinaryTree()
{
   
        //创建结点
        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()
{
   
        CresteBinaryTree();
        return EXIT_SUCCESS;
}