Insertion and delection of linked list

[dickylau]

I got a question about the singly linked list for (1) inserting the new record before the users type the number of the position & (2) removing the name of the record which users type the name.

bool Database::remove(char *recName)
{
    Record *pCurr, *pPrev, *rec;
    pCurr = pFirst;
    int i = 0;
    do
    {
        pPrev = pCurr;
        pCurr = pPrev->getNext();
        i++;
    }
    while(pCurr!=0);
    rec = pCurr->getNext();
    pPrev->setNext(rec);
    delete pCurr;
    return true;
}
bool Database::insert(int pos, Record *rec)
{
    Record *pC;
    pC = pFirst;
    int i = numRecord;
    if(pos>= numRecord)
    {
        cout << "Cannot insert!!!\n";
    }
    else
    {
        while (i<pos)
        {
            pC = pC->getNext();
            i--;
        }
        rec = new Record;
        rec->setNext(pC->getNext());
        pC->setNext(rec);
    }
    return false;
}

From main.cpp

switch (choice)
        {
        case 'i': case 'I':
            {
                char name1[6];
                int pos1;
                Record *r = new Record;
                cout << "Name of Record? ";
                cin >> name1;
                cout << "Insert before Record#? ";
                cin >> pos1;
                char *NameInHeap = new char[6];
                NameInHeap[0] = '\0';
                strcpy(NameInHeap, name1);
                r->setName(NameInHeap);
                db.insert(pos1, r);
            }
            break;
        case 'r': case 'R':
            {
                char name2[6];
                cout << "Name of Record to be deleted?\t";
                cin >> name2;
                cout << endl;
                char *nameInHeap = new char[6];
                nameInHeap[0] = '\0';
                strcpy(nameInHeap, name2);
                db.remove(nameInHeap);
            }
            break;

How do i implement those functions?? For insertion, the users type the number for the position he/she wants to insert the new record before the position he/ahe wants.

Thank you!!
Dicky

[DeMan]

Basically, assuming the list isn't sorted in any way, if the person selects n you would start at the first node and jump to the next element n times. Create a new node and set it's nextNode to point to the currentNode's nextNode. then Set the currentNode's nextNode to point to the newly created node:

a-b-c-d-e

we want to insert f after b, so we skip to b and create f.
f.next = b.next (which will be c)
b.next =f;

a-b-f-c-d-e

[dickylau]

But, the screen shows the strange charcters...............how do i get rid of the strange characters??

[DeMan]

If you try to print a structure it may not print exactly what you want unless you print each element explicitly. Furthermore, if you try to print a pointer you will print a pointer, make sure you are printing the value at thepointer