What are the two different ways to resolve the limitation of a linear queue? Which one is better and why? Explain
with example.
Answers
Answered by
0
Answer:
When any element is inserted in linear queue then rear will be increased by 1. Let, assume after insertion operations rear is shifted to last position in queue. It means, now queue is full. Now if a new element is inserted then overflow condition will occur.
Similar questions