circularly linked lists in section we introduced the notion of "circulararray and demonstrated its use in implementing the queue adt in realitythe notion of circular array was artificialin that there was nothing about the representation of the array itself that was circular in structure it was our use of modular arithmetic when "advancingan index from the last slot to the first slot that provided such an abstraction in the case of linked liststhere is more tangible notion of circularly linked listas we can have the tail of the list use its next reference to point back to the head of the listas shown in figure we call such structure circularly linked list lax msp atl head bos tail figure example of singly linked list with circular structure circularly linked list provides more general model than standard linked list for data sets that are cyclicthat iswhich do not have any particular notion of beginning and end figure provides more symmetric illustration of the same circular list structure as figure lax msp bos current atl figure example of circular linked listwith current denoting reference to select node circular view similar to figure could be usedfor exampleto describe the order of train stops in the chicago loopor the order in which players take turns during game even though circularly linked list has no beginning or endper sewe must maintain reference to particular node in order to make use of the list we use the identifier current to describe such designated node by setting current current nextwe can effectively advance through the nodes of the list