Zadanie Dejwu, C++ (clang)

Language: Layout:

#include <iostream>

class Node {
  public:
    Node() = delete;
    Node(int d) : data{d} { next = nullptr; }
    Node(int d, Node* ptr) : data{d}, next{ptr} {}

static void deleteNode(Node * ptr) {
        
        if(ptr == nullptr) return;
        
        //tail
        else if(ptr->next == nullptr) {
            //(ptr--)->next == nullptr;
            //delete ptr;
        }
        
        //rest
        else {
            Node * tmp = ptr->next;
            ptr->data = tmp->data;
            ptr->next = tmp->next;
            delete tmp;
        }
    }
    
    static void printList(Node * ptr) {
        while(ptr != nullptr) {
        std::cout << ptr->data << '\n';
        ptr = ptr->next;
        }
    }

int data;
    Node *next;
};

int main()
{
    Node* third = new Node(3);
    Node* second = new Node(2, third);
    Node* head = new Node(1, second);
    
    Node::printList(head);
    
    Node::deleteNode(third);
    std::cout<<'\n';
    Node::printList(head);
}

Show compiler warnings [ + ] Compiler args [ + ] Show input
Compilation time: 0.73 sec, absolute running time: 0.06 sec, cpu time: 0.01 sec, memory peak: 3 Mb, absolute service time: 0,8 sec