假设二叉树采用二叉链存储结构进行存储，设计一个算法采用分治法求一棵二叉树bt的高度和度为2的结点个数（C语言）

1.题目

假设二叉树采用二叉链存储结构进行存储，

1.设计一个算法采用分治法求一棵树二叉树bt的高度。

2.设计一个算法采用分治法求一棵二叉树bt中度为2的结点个数

2.代码

#include <stdio.h>
#include <stdlib.h>

int max(int a, int b) {
    return a > b ? a : b;
}

typedef struct TreeNode {
    int data;
    struct TreeNode *left;
    struct TreeNode *right;
} TreeNode;

// 创建新节点
TreeNode* createNode(int data) {
    TreeNode* newNode = (TreeNode*) malloc(sizeof(TreeNode));
    if (newNode == NULL) {
        fprintf(stderr, "Memory allocation failed.\n");
        exit(EXIT_FAILURE);
    }
    newNode->data = data;
    newNode->left = newNode->right = NULL;
    return newNode;
}

// 插入节点到二叉树
TreeNode* insertNode(TreeNode* root, int data) {
    if (root == NULL)
        return createNode(data);

    if (data < root->data)
        root->left = insertNode(root->left, data);
    else if (data > root->data)
        root->right = insertNode(root->right, data);

    return root;
}

// 求二叉树高度
int height(TreeNode* node) {
    if (node == NULL)
        return 0;

    int left_height = height(node->left);
    int right_height = height(node->right);

    return 1 + max(left_height, right_height);
}



// 求度为2的节点个数
int countDegreeTwoNodes(TreeNode* node) {
    if (node == NULL || (node->left == NULL && node->right == NULL))
        return 0;

    int left_count = countDegreeTwoNodes(node->left);
    int right_count = countDegreeTwoNodes(node->right);

    int count = (node->left != NULL && node->right != NULL) ? 1 : 0;

    return left_count + right_count + count;
}
void freeTree(TreeNode* node) {
    if (node == NULL)
        return;

    freeTree(node->left);
    freeTree(node->right);
    free(node);
}
int main() {
    // 定义节点数据数组
    int nodeData[] = {8, 3, 10, 1, 6, 14, 4, 7, 13};

    // 创建并初始化一棵二叉树
    TreeNode* root = NULL;
    for (int i = 0; i < sizeof(nodeData) / sizeof(nodeData[0]); i++) {
        root = insertNode(root, nodeData[i]);
    }

    int height_result = height(root);
    int degree_two_count = countDegreeTwoNodes(root);

    printf("二叉树bt的高度: %d\n", height_result);
    printf("二叉树bt中度为2的节点个数: %d\n", degree_two_count);

    // 释放内存
    freeTree(root);

    return 0;
}

3.运行结果