Doubly Linked Lists
Is the ideal solution to have a tail
pointer instead? are there any
drawbacks to a tail pointer?
tail->next = new node;
tail->next->prev = tail;
tail->next->next = NULL;
every time the list is altered the tail pointer
must be updated
