Usuwanie elementu z listy jednokierunkowej C++

#include <iostream>

using namespace std;

struct eList {
    int val;
    eList * next;
};

eList * createList() {
   
    eList * start, * present, * tail;
    start = NULL;
    present = NULL;
    for( int i = 0; i < 5; i++ ) {
        tail = present;
        present = new eList;
        cout << "Podaj " << i + 1 << " element listy: ";
        cin >> present->val;
        present->next = NULL;
       
        if( start == NULL ) {
            start = present;
        } else {
            tail->next = present;
        }
    }
    return start;
}

void printList( eList * start ) {
    eList * present;
    present = start;
    cout << "\nDrukuje liste: ";
    while( present ) {
        cout << present->val << " ";
        present = present->next;
    }
}

eList * addBigestValueAtEnd( eList *& start ) {
    eList * present, * tempMax;
    present = start;
    tempMax = start;
    while( present ) {
        if( present->val > tempMax->val ) {
            tempMax = present;
        }
        present = present->next;
    }
   
    eList * helpPointer;
    present = start;
    if( present ) {
        while( present->next ) present = present->next;
       
        helpPointer = new eList;
        helpPointer->val = tempMax->val;
        helpPointer->next = NULL;
        present->next = helpPointer;
    } else {
        cout << "\nPusta lista. ";
    }
    return start;
}

int countList( eList * start ) {
    eList * present;
    present = start;
    int howMany = 0;
    while( present ) {
        howMany++;
        present = present->next;
    }
    return howMany;
}

bool isRemoved( eList *& start, int numberToRemove ) {
    eList * present, * helpPointer;
    eList * elementPrzedUsuwanym;
    present = start;
    int howMany = 0;
    while( present ) {
        howMany++;
        present = present->next;
    }
   
    bool lastResult = true;
   
    if( present == NULL ) lastResult = false;
   
    if( howMany < numberToRemove ) {
        cout << "\nW liscie jest za malo elementow \n";
        lastResult = false;
    } else {
        for( int i = 1; i < numberToRemove; i++ ) {
            present = present->next;
        }
        elementPrzedUsuwanym = present; // tu chciałbym "złapać adres elementu poprzedzającego element usuwany
        present->next = elementPrzedUsuwanym->next->next; // tu chciałem połączyć elementy listy
        //helpPointer = present;
        //elementPrzedUsuwanym->next = present->next;
        delete elementPrzedUsuwanym->next;
    }
    return lastResult;
}

int main()
{
    eList * start;
    start = NULL;
    start = createList();
    printList( start );
   
    addBigestValueAtEnd( start );
    printList( start );
   
    bool removed;
    int numberToRemove = 0;
    cout << "\nKtory element listy chcesz usunac? ";
    cin >> numberToRemove;
    removed = isRemoved( start, numberToRemove );
    if( removed ) {
        cout << "\nUsunieto element.";
    } else {
        cout << "\nNie usunieto elementu.";
    }
    printList( start );
   
    return 0;
}