 With a circular list, a pointer to the last node gives easy access also to the first node, by following one link.Thus, in applications that require access to both ends of the list (e.g., in the implementation of a queue), a circular structure allows one to handle the structure by a single pointer, instead of two.A circular list can be split into two circular lists, in constant time, by giving the addresses of the last node of each piece.