Only the rear pointers will change during an insertion into a non-empty queue if the queue is implemented using a linked list, keeping track of a front pointer.
Both values have changed because the queue has begun. If new nodes are added to the linked list's beginning during a push operation, nodes must be removed from the end during a pop operation. If additional nodes are added at the end of a push action, they must be removed at the beginning of a pop operation. Although arrays don't need space for pointers and can be accessed randomly, they are inefficient for memory allocation and insertion/deletion operations. Linked lists, on the other hand, are dynamic and have less temporal complexity for insertion and deletion.
Learn more about Queue here-
https://brainly.com/question/24108531
#SPJ4
