(Naiv) Double linked list

DoubleLinkedList.cpp

// xhttps://www.youtube.com/watch?v=VOQNf1VxU3Q&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P&index=14&t=0s

#include <iostream>

struct Node {
    int value;
    Node* prev;
    Node* next;
    Node(int x): prev(nullptr), next(nullptr)
    {
        value = x;
    }
};

class DLinkList {
private:
    Node* head;
    Node* last;
public:
    DLinkList() {
        head = nullptr;
        last = nullptr;
    }
    Node* getHead() {
        return head;
    }
    void print() {
        Node* temp = head;
        while (temp != nullptr) {
            std::cout << temp->value << std::endl;
            temp = temp->next;
        }
    }
    void addAtBegining(int value) {
        Node* node = new Node(value);
        if (head == nullptr) {
            head = node;
            return;
        }
        head->prev = node;
        node->next = head;
        head = node;
    }
    // iterative reverse
    void reverseIterative() {}
    // recursive print reverse
    void recurisvePrintReverse(Node* currentNode) {
        std::cout << currentNode->value << std::endl;
        if (currentNode->next == nullptr) {
            return;
        }
        recurisvePrintReverse(currentNode->next);
    }
};

int main() {
    DLinkList list;
    list.addAtBegining(1);
    list.addAtBegining(2);
    list.addAtBegining(3);
    list.print();
    return 0;
}