Consider the circular queue implemented using a linked list that only has a 'tail' reference. list Create an 'remove' method that removes nodes from the 'head' of the list. Handle all the special...

Extracted text: Consider the circular queue implemented using a linked list that only has a 'tail' reference. list Create an 'remove' method that removes nodes from the 'head' of the list. Handle all the special cases and always preserve the circular property of the data structure. Hint: remember the 'head' node is just 'tail.next.