@Homefrukt
    void deleteElem(Node* elem)
    {
        Node* prev = nullptr;
        for(auto iter : *this)
        {
            if(iter == elem)
            {
                if(prev == nullptr)
                {
                    Node* newHead = head->next;
                    delete head;
                    head = newHead;
                } else
                {
                    prev->next = elem->next;
                    delete elem;
                }
                break;
            }
            prev = iter;
        }
    }


    Node* append(const Node::data& t)
    {
        rows = (t.rows > rows) ? t.rows : rows;
        if(Node* node = new Node(t))
        {
            node->next = head;
            head = node;
        }
        return head;
    }