Suppose that x and y are references to nodes of circularly linked lists, although not necessarily the same list. Describe a fast algorithm for telling if x and y belong to the same list.   Our...

Suppose that
x
and
y
are references to nodes of circularly linked lists,

although not necessarily the same list. Describe a fast algorithm for telling

if
x
and
y
belong to the same list.

Our CircularQueue class of Section 7.2.2 provides a rotate( ) method that

has semantics equivalent to Q.enqueue(Q.dequeue( )), for a nonempty

queue. Implement such a method for the LinkedQueue class of Section

7.1.2 without the creation of any new nodes.