在C++11中，有没有一个很好的方法可以打印出类似JSON的trie结构(仅限迭代解决方案)的扁平化名称空间？

#include <iostream>
#include <stack>
#include <string>
#include <unordered_map>

struct TrieNode {
    std::unordered_map<char, TrieNode*> children;
    bool isEndOfWord;
    std::string prefix;

    TrieNode(const std::string& prefix = "") : isEndOfWord(false), prefix(prefix) {}
};

void printTrie扁平化名称空间(TrieNode* root) {
    if (!root) return;

    std::stack<std::pair<TrieNode*, std::string>> stack;
    stack.push({root, ""});

    while (!stack.empty()) {
        auto [node, currentPath] = stack.top();
        stack.pop();

        if (node->isEndOfWord) {
            std::cout << "{" << currentPath << "}" << std::endl;
        }

        for (const auto& [ch, childNode] : node->children) {
            stack.push({childNode, currentPath.empty() ? std::string(1, ch) : currentPath + "." + ch});
        }
    }
}

int main() {
    TrieNode* root = new TrieNode();
    root->children['a'] = new TrieNode("a");
    root->children['a']->children['b'] = new TrieNode("a.b");
    root->children['a']->children['b']->isEndOfWord = true;
    root->children['c'] = new TrieNode("c");
    root->children['c']->isEndOfWord = true;

    printTrie扁平化名称空间(root);

    // 清理分配的内存
    // 这里省略了内存清理的代码，实际应用中需要确保释放所有分配的内存

    return 0;
}