在C++中寻找二叉树的最大高度路径

#include <iostream>
#include <algorithm>

struct TreeNode {
    int val;
    TreeNode* left;
    TreeNode* right;
    TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
};

int findMaxHeight(TreeNode* root) {
    if (root == nullptr) {
        return 0;
    }
    
    int leftHeight = findMaxHeight(root->left);
    int rightHeight = findMaxHeight(root->right);
    
    return std::max(leftHeight, rightHeight) + 1;
}

int main() {
    // 构建二叉树
    TreeNode* root = new TreeNode(1);
    root->left = new TreeNode(2);
    root->right = new TreeNode(3);
    root->left->left = new TreeNode(4);
    root->left->right = new TreeNode(5);
    
    int maxHeight = findMaxHeight(root);
    std::cout << "The maximum height of the binary tree is: " << maxHeight << std::endl;
    
    // 释放内存
    delete root->left->left;
    delete root->left->right;
    delete root->left;
    delete root->right;
    delete root;
    
    return 0;
}