在树c++中查找特定的节点高度

#include <iostream>
#include <algorithm>

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

int findNodeHeight(TreeNode* root, int target) {
    if (root == nullptr) {
        return -1; // 节点不存在，返回-1表示未找到
    }
    
    if (root->val == target) {
        return 0; // 找到目标节点，高度为0
    }
    
    int leftHeight = findNodeHeight(root->left, target);
    int rightHeight = findNodeHeight(root->right, target);
    
    if (leftHeight == -1 && rightHeight == -1) {
        return -1; // 左右子树都未找到目标节点，返回-1表示未找到
    }
    
    return std::max(leftHeight, rightHeight) + 1; // 返回左右子树中较大的高度加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);
    root->right->left = new TreeNode(6);
    root->right->right = new TreeNode(7);

    int target = 5;
    int height = findNodeHeight(root, target);
    
    if (height == -1) {
        std::cout << "未找到节点 " << target << std::endl;
    } else {
        std::cout << "节点 " << target << " 的高度为 " << height << std::endl;
    }
    
    // 释放内存，防止内存泄漏
    delete root->left->left;
    delete root->left->right;
    delete root->right->left;
    delete root->right->right;
    delete root->left;
    delete root->right;
    delete root;
    
    return 0;
}