Maintaining an additional pointer to the first node in a doubly linked list

Why would it be cumbersome to maintain an additional pointer to the first node in a doubly linked list?
It is not cumbersome at all. Most implementation of doubly linked lists maintain pointers to both head and tail nodes to provide fast accesss to begin/end iterators and allow easy fast insertion on both ends.
Topic archived. No new replies allowed.