Question regarding cases of linked lists

[dlugo]

Guys, this might be kind of a silly questions but I would like a concrete answer on this so I will ask anyways.

Are there 4 cases in inserting and removing a node?
1.) inserting the first node if the list is empty
2.) inserting a node at the beginning of the list
3.) inserting a node in the middle of the list
4.) inserting a node at the end of the list

(same concept for removing)

I ask because my remove and insert functions look almost identical (with the exception of deleting the node) and if there are less cases then I can shorten up my code.

Thanks in advance.

[hamsterman]

While logically these are separate cases, depending on your implementation, one could be sufficient.

[dlugo]

Well in the case that you're reading numbers or words from a file and putting them in numerical/alphabetical order then these would be the four separate cases, right?

[hamsterman]

That's not what I meant by 'implementation'
example - a single linked list:

struct node{
    //some data..
    node* next;
};

struct list{
    node* head;

    void add(node*& where, /*data*/){
        node* tmp = where;
        node* n = new node;
        //assign data to n->data
        n->next = tmp;
        where = n;
    }
};

This should work (haven't tested it) in all four cases. I'm not sure if a double linked list would work as nicely. You may have to add few ifs.