C++ -如何计算程序在二叉树中查找值所用的比较次数

struct TreeNode {
    int val;
    TreeNode* left;
    TreeNode* right;
};

int search(TreeNode* root, int target, int& count) {
    if (root == nullptr) {
        return -1;  // 未找到目标值
    }
    
    count++;  // 比较次数加1
    
    if (root->val == target) {
        return count;  // 找到目标值，返回比较次数
    }
    else if (root->val > target) {
        return search(root->left, target, count);  // 向左子树查找
    }
    else {
        return search(root->right, target, count);  // 向右子树查找
    }
}

int main() {
    // 构建二叉树
    TreeNode* root = new TreeNode{5, nullptr, nullptr};
    root->left = new TreeNode{3, nullptr, nullptr};
    root->right = new TreeNode{7, nullptr, nullptr};
    root->left->left = new TreeNode{2, nullptr, nullptr};
    root->left->right = new TreeNode{4, nullptr, nullptr};
    root->right->left = new TreeNode{6, nullptr, nullptr};
    root->right->right = new TreeNode{8, nullptr, nullptr};
    
    int target = 4;
    int count = 0;
    int result = search(root, target, count);
    
    if (result == -1) {
        cout << "未找到目标值" << endl;
    }
    else {
        cout << "查找目标值所用的比较次数为：" << result << 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;
}