Null-terminated linked list

A linked list whose final node has a null successor, with a null head denoting emptiness. A finite acyclic representation supports a traversal that repeatedly follows next until null. A circular linked list needs a different stopping rule because its final successor points back into the list.