在二进制搜索树C++中计算平均值

#include <iostream>

// 二进制搜索树节点定义
struct TreeNode {
    int val;
    TreeNode* left;
    TreeNode* right;
    TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
};

// 中序遍历二叉树并计算平均值
void inorderTraversal(TreeNode* root, int& sum, int& count) {
    if (root == nullptr) {
        return;
    }
    inorderTraversal(root->left, sum, count);
    sum += root->val;
    count++;
    inorderTraversal(root->right, sum, count);
}

// 计算二叉搜索树的平均值
double calculateAverage(TreeNode* root) {
    int sum = 0;
    int count = 0;
    inorderTraversal(root, sum, count);
    if (count == 0) {
        return 0.0;
    }
    return static_cast<double>(sum) / count;
}

int main() {
    // 构建一个二叉搜索树
    TreeNode* root = new TreeNode(4);
    root->left = new TreeNode(2);
    root->right = new TreeNode(6);
    root->left->left = new TreeNode(1);
    root->left->right = new TreeNode(3);
    root->right->left = new TreeNode(5);
    root->right->right = new TreeNode(7);

    // 计算平均值
    double average = calculateAverage(root);
    std::cout << "平均值：" << average << std::endl;

    // 释放内存
    // ...

    return 0;
}