“FRONT=REAR” pointer refers to empty
Reveal answer
Fill a bubble to check yourself
Keep practicing — related questions
- The function of “ Buffer” is performed as,
- A data structure in which elements may be added to or deleted from the front or the rear is called a
- ___________ pointer is incremented in a queue when a new element is added.
- Which data structure allows deleting of data elements from front and insertion at rear?
- Which of the following is not related to stack data structure?
- Which data structure allows deleting data elements from front and inserting at rear?
- If Front = Rear, then what does it state about a queue?
- Which data structure allows deleting data elements from front and inserting at rear ends?