yes , A circular queue follows the FIFO principle, where elements are inserted at the rear and removed from the front. It efficiently reuses space by allowing insertion at any empty spot once the end of the queue is reached, wrapping around circularly. that line is incorrect but what i actually want to tell is that we can add at all the empty spot in circular queue but in linear there may be empty spot . So basically , In a linear queue, empty space may exist at the front after dequeuing elements, but it cannot be reused for new insertions due to the fixed front-to-rear progression. Sorry for confusion ! Thank you
Do like , Share and Subscribe 🙏🙏
Are circular me vi to fifo hi follow hota hai
yes , A circular queue follows the FIFO principle, where elements are inserted at the rear and removed from the front. It efficiently reuses space by allowing insertion at any empty spot once the end of the queue is reached, wrapping around circularly.
that line is incorrect but what i actually want to tell is that we can add at all the empty spot in circular queue but in linear there may be empty spot . So basically , In a linear queue, empty space may exist at the front after dequeuing elements, but it cannot be reused for new insertions due to the fixed front-to-rear progression.
Sorry for confusion ! Thank you
Practice karo abi
karo beta
mapani safal ho 😂
hora ! kripaya sabhye bhasa prayog gardinuhos
@@EducationSafal ok sorry 😞