code:

class listnode{
      listnode  next;
      listnode  prev; //if we're doing doubly-linked
      t  data;
}

class list{
     listnode  head;
     listnode  tail; //if you want/you're not doubly linked and want a quicky way to append to the back.
     int count;

    public void add(listnode){...}
    public bool remove(listnode){...}
   //maybe also some helpers for removing at a certain index, etc
}