Reverse linked list

linkedlist_reverse.cpp

struct LinkedList
{
    struct Node
    {
        Node* next;
        int value;
    };

    LinkedList(std::initializer_list<int> list)
    {
        Node* node = nullptr;
        for (int value : list)
        {
            Node* newNode = new Node();
            newNode->next = nullptr;
            newNode->value = value;
            if (root == nullptr)
            {
                root = newNode;
                node = newNode;
            }
            else 
            {
                node->next = newNode;
                node = newNode;
            }
        }
    }

    ~LinkedList()
    {
        Node* node = root;
        while (node != nullptr)
        {
            Node* next = node->next;
            delete node;
            node = next;
        }
    }

    void reverse()
    {
        Node* prev = nullptr;
        Node* node = root;
        while (node != nullptr)
        {
            Node* next = node->next;
            node->next = prev;
            prev = node;
            node = next;
        }
        root = prev;
    }

    void print() const
    {
        printFmt("{ ");
        for (const Node* node = root; node != nullptr; node = node->next)
        {
            printFmt("%d ", node->value);
        }
        printFmt("}\n");
    }

    Node* root  = nullptr;
};

void test2()
{
    LinkedList list1 = { 1, 2, 3, 4, 5, 6 };
    list1.print();
    list1.reverse();
    list1.print();
}