In the time of enqueuing we are using tail pointer to direct insert the node in rear
so it takes O(1) in worst .
But in the time if dequeuing we are traversing that tail pointer to the first node where head already exists..so now to delete or dequeue the element we need to traverse tail pointer to whole SLL to get that front pointer node in queue. SO O(n) in worst case.