![]() The efficient approach to avoid the wastage of the memory is to use the circular queue data structure. It is not a practically good approach because shifting all the elements will consume lots of time. There is one solution to avoid such wastage of memory space by shifting both the elements at the left and adjust the front and rear end accordingly. The rear is at the last position of the Queue if we try to insert the element then it will show that there are no empty spaces in the Queue. In the above array, there are only two elements and other three positions are empty. So, to overcome such limitations, the concept of the circular queue was introduced.Īs we can see in the above image, the rear is at the last position of the Queue and front is pointing somewhere rather than the 0 th position. If the rear reaches to the end position of the Queue then there might be possibility that some vacant spaces are left in the beginning which cannot be utilized. There was one limitation in the array implementation of Queue. ![]() Next → ← prev Circular Queue Why was the concept of the circular queue introduced?
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |