Circular list with TAIL pointer

Circular list with TAIL pointer

In single linked list problem occurs when we want to insert node at the last of the list to solve this problem alternative is maintain a TAIL pointer instead of head pointer .This TAIL pointer  points to the last node of the list using this pointer we can directly access the last node without traversing the whole list.