![]() The queue is used when things don’t have to be processed immediately, but have to be processed in First In First Out order like Breadth First Search. This queue is used in cases where the consumption of the data needs to be in FIFO order but if there is a need to remove the recently inserted data for some reason and one such case can be irrelevant data, performance issue, etc. This kind of Queue does not follow FIFO(first in first out). Input restricted Queue: In this type of Queue, the input can be taken from one side only(rear) and deletion of elements can be done from both sides(front and rear). The time complexity for the circular Queue is O(1).Ģ. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |