Question

linked list has been used to implement a queue which has 2 pointers front and rear​

Answer 1

Answer:

Explanation:

In the linked queue, there are two pointers maintained in the memory i.e. front pointer and rear pointer. The front pointer contains the address of the starting element of the queue while the rear pointer contains the address of the last element of the queue.

Answer 2

Queue with the help of linked list:

• The implementation of an array cannot be used for the applications which are done on a huge scale. Using a linked list to build a queue is an alternative to utilizing the functions of an array.
• While the time required for operations is o, the storage is in need of a linked representation of a queue which has n elements and is in the form of  o(n) (1).
• Each node in a linked queue is made up of two components, that is the data part and the link part. Every item in the queue connects the item in the memory that comes right after it.
• Two pointers that are the front pointer and the rear pointer, are kept stored in memory for the linked queue. The addresses of the first and last elements in the queue are respectively placed in the front pointer and the rear pointer.

Learn more here

https://brainly.in/question/37182690

#SPJ1