尝试在C++中打印树的内容时出现内存分配错误

void printTreeIteratively(TreeNode* root) {
    if (!root) return;
    std::stack<TreeNode*> stack;
    stack.push(root);
    while (!stack.empty()) {
        TreeNode* node = stack.top();
        stack.pop();
        std::cout << node->value << " ";
        if (node->right) stack.push(node->right);
        if (node->left) stack.push(node->left);
    }
}

struct TreeNode {
    int value;
    std::shared_ptr<TreeNode> left;
    std::shared_ptr<TreeNode> right;
    TreeNode(int val) : value(val), left(nullptr), right(nullptr) {}
};

#include <iostream>
#include <memory>
#include <stack>

struct TreeNode {
    int value;
    std::shared_ptr<TreeNode> left;
    std::shared_ptr<TreeNode> right;
    TreeNode(int val) : value(val), left(nullptr), right(nullptr) {}
};

void printTreeIteratively(const std::shared_ptr<TreeNode>& root) {
    if (!root) return;
    std::stack<std::shared_ptr<TreeNode>> stack;
    stack.push(root);
    while (!stack.empty()) {
        auto node = stack.top();
        stack.pop();
        std::cout << node->value << " ";
        if (node->right) stack.push(node->right);
        if (node->left) stack.push(node->left);
    }
}

int main() {
    auto root = std::make_shared<TreeNode>(1);
    root->left = std::make_shared<TreeNode>(2);
    root->right = std::make_shared<TreeNode>(3);
    root->left->left = std::make_shared<TreeNode>(4);
    root->left->right = std::make_shared<TreeNode>(5);

    printTreeIteratively(root);
    return 0;
}