in sculls do we have to make a linked representation of a queue and then insert elements into that queue by changing the rear pointerie that rear pointer will subsequently point to the location of the node of the linked list which is represented as a queue and then we will store the characters in that node and move on to the next rear pointer location
