in ( time we also avoid the need to specify maximum size for the queueas was done in the array-based queue implementationbut this benefit comes at the expense of increasing the amount of space used per element stillthe methods in the singly linked list queue implementation are more complicated than we might likefor we must take extra care in how we deal with special cases where the queue is empty before an enqueue or where the queue becomes empty after dequeue round robin schedulers popular use of the queue data structure is to implement round robin schedulerwhere we iterate through collection of elements in circular fashion and "serviceeach element by performing given action on it such schedule is usedfor exampleto fairly allocate resource that must be shared by collection of clients