计算存储为向量数组C++的通用树的每个节点的高度

#include <iostream>
#include <vector>

using namespace std;

// 定义通用树的节点结构
struct TreeNode {
    int value;
    vector<TreeNode*> children;
};

// 递归计算通用树每个节点的高度
int calculateHeight(TreeNode* node) {
    if (node == nullptr) {
        return 0;
    }

    int maxHeight = 0;
    for (TreeNode* child : node->children) {
        int childHeight = calculateHeight(child);
        maxHeight = max(maxHeight, childHeight);
    }

    return maxHeight + 1;
}

int main() {
    // 构造一个通用树示例
    TreeNode* root = new TreeNode();
    root->value = 1;

    TreeNode* node2 = new TreeNode();
    node2->value = 2;

    TreeNode* node3 = new TreeNode();
    node3->value = 3;

    TreeNode* node4 = new TreeNode();
    node4->value = 4;

    TreeNode* node5 = new TreeNode();
    node5->value = 5;

    // 将子节点连接到父节点
    root->children.push_back(node2);
    root->children.push_back(node3);
    node2->children.push_back(node4);
    node2->children.push_back(node5);

    // 计算每个节点的高度并输出结果
    cout << "节点1的高度: " << calculateHeight(root) << endl;
    cout << "节点2的高度: " << calculateHeight(node2) << endl;
    cout << "节点3的高度: " << calculateHeight(node3) << endl;
    cout << "节点4的高度: " << calculateHeight(node4) << endl;
    cout << "节点5的高度: " << calculateHeight(node5) << endl;

    // 释放内存
    delete node5;
    delete node4;
    delete node3;
    delete node2;
    delete root;

    return 0;
}