Свой лист

struct Node
{
    Node* next;
    int value;
};
 
class MyList
{
    Node* first;
    Node* last;
 
public:
    MyList() {};
 
    Node* addNode(Node* aNodeBefore, int aValue)
    {
        Node *node = new Node;
        node->value = aValue;
 
        if (aNodeBefore == last)
            last = node;
 
        Node* tmp = aNodeBefore->next;
        aNodeBefore->next = node;
        node->next = tmp;
 
        return node;
    }
 
    Node* deleteNode(Node* aNodeToDelete)
    {
        bool flag = false;
        Node *nodeBefore = first;
        while (nodeBefore->next != aNodeToDelete)
            nodeBefore = nodeBefore->next;
 
        nodeBefore->next = aNodeToDelete->next;
        delete aNodeToDelete;
        return nodeBefore->next;
    }
 
    Node* deleteFirst()
    {
        first = first->next;
        return first;
    }
 
};