data structures - How to find the last element in the singly linked list? -

in singly linked list, know next of last node point null, can find out traversing.

if last node of singly linked list point middle node how can find last node?

if "last node" points other node, isn't last node, it? not mention stretch , possibly break commonly accepted definiton of "list".

normally find last element

node *current = list.start,      *next = current.next;  while (next != null) {     current = next;     next = current.next; }  print("last node " + current->value); 

however, assumes "last node" point null. otherwise stuck in infinite loop.

it's practice keep pointer last node of list first, that's trivial solution doesn't depend on last node pointing null.