Straight Linked Lists

A straight linked list uses a NULL to show the end of the list. Each node has a pointer which refers to the next node. When this node is NULL, then the node is the last one on the list.
If the list is doubly linked, then there is also a previous pointer, which refers to the prior node. This one will be NULL if this is the first node on the list.
Straight lists often use the trailing pointer technique for insertions, deletions and other list-changing operations. This is discussed in the next exhibit.

Links:
Trailing Pointer Technique
List Types