If only the head pointer is set, how long does it take to enter or dequeue? ? ?

vampillur

Let a chain queue of length n be represented by a single-loop linked list
If only the head pointer is set, how long does it take to enter or dequeue? ? ?
What if we only set the tail pointer? ?
How much time does it take

maloneliu

The characteristics of the queue are: first-in first-out;
The characteristics of the single chain are: when iterating, you can only move forward, not turn back;
In the case where only the head pointer is known:
Into the pair: first traverse the single chain, find the tail pointer, time complexity O (n);
Out of right: just directly access the head pointer, time complexity O(1);
Only know that the situation of the tail pointer is the opposite of the analysis above.

vampillur

Thank you