使用模板实现包含多个类型的树的C++

#include <iostream>
#include <vector>

template <typename T>
class TreeNode {
public:
    T data;
    std::vector<TreeNode<T>*> children;

    TreeNode(const T& value) : data(value) {}
};

template <typename T>
class Tree {
private:
    TreeNode<T>* root;

public:
    Tree() : root(nullptr) {}

    void insert(const T& value, TreeNode<T>* parent) {
        TreeNode<T>* newNode = new TreeNode<T>(value);
        parent->children.push_back(newNode);
    }

    void traverse(TreeNode<T>* node) {
        if (node == nullptr) {
            return;
        }

        std::cout << node->data << " ";

        for (TreeNode<T>* child : node->children) {
            traverse(child);
        }
    }
};

int main() {
    Tree<int> tree;

    TreeNode<int>* root = new TreeNode<int>(1);
    tree.insert(2, root);
    tree.insert(3, root);
    tree.insert(4, root);

    TreeNode<int>* child1 = root->children[0];
    tree.insert(5, child1);
    tree.insert(6, child1);

    TreeNode<int>* child2 = root->children[1];
    tree.insert(7, child2);

    tree.traverse(root);

    return 0;
}