二叉树辅助函数，用于acm模式刷题

#include 
using namespace std;

// 先定义TreeNode和Solution类

// ...

void printInOrder(TreeNode* node) {
    if (node == nullptr) {
        return;
    }
    printInOrder(node->left);
    std::cout << node->val << " ";
    printInOrder(node->right);
}

void deleteTree(TreeNode* node) {
    if (node == nullptr) {
        return;
    }
    deleteTree(node->left);
    deleteTree(node->right);
    delete node;
}

int main() {
    // 创建测试树
    TreeNode* root = new TreeNode(5);
    root->left = new TreeNode(3);
    root->right = new TreeNode(6);
    root->left->left = new TreeNode(2);
    root->left->right = new TreeNode(4);
    root->right->right = new TreeNode(7);

    // 打印原始树
    std::cout << "原始树的中序遍历: ";
    printInOrder(root);
    std::cout << std::endl;

    
    Solution solution;
    //调用题目的方法进行验证

    // 打印更新后的树
    printInOrder(root);
    std::cout << std::endl;

    // 清理分配的内存
    deleteTree(root);
}