Перераспределение памяти

int Add(datas value, int position)
{
    _count++;
    node = (DoubleList*)realloc(node, sizeof(DoubleList)*_count);
    node->element = value;
    if (head == NULL)
    {
        node->next = NULL;
        node->next = node;
        node->prev = node;
        head = tail = node; 
    }
    else
    {
        DoubleList *p = head;
        for (int i = position; i > 1; i--) p = p->next;
        p->prev->next = node;
        node->next = p;
        p->prev = node;
        node->prev = p->prev;
    }
    cout << "Element added" << endl;
    return 0;
}

        node->next = NULL;
        node->next = node;
        node->prev = node;

 node->next = NULL;
 node->next = NULL;
 node->prev = NULL

int Add(datas value, int position)
{
    node = (DoubleList*)realloc(node, sizeof(DoubleList));
    node->element = value;
    if (head == NULL)
    {
        node->next = NULL;
        node->next = node;
        node->prev = node;
        head = tail = node; 
    }
    else
    {
        DoubleList *p = head;
        for (int i = position; i > 1; i--) p = p->next;
        p->prev->next = node;
        node->next = p;
        p->prev = node;
        node->prev = p->prev;
    }
    cout << "Element added" << endl;
    return 0;
}