반응형 dataStructure2 [자료구조] Circular Queue Circular Queue Data StructureA circular queue is the extended version of a regular queue where the last element is connected to the first element. Thus forming a circle-like structure. The circular queue solves the major limitation of the normal queue. In a normal queue, after a bit of insertion and deletion, there will be non-usable empty space. Here, indexes 0 and 1 can only be used af.. 2024. 6. 20. [자료구조] Queue Queue Data StructureA queue is a useful data structure in programming. It is similar to the ticket queue outside a cinema hall, where the first person entering the queue is the first person who gets the ticket.Queue follows the First In First Out(FIFO) rule - the item that goes in first is the item that comes out first. In the above image, since 1 was kept in the queue before 2, it is the firs.. 2024. 6. 20. 이전 1 다음 반응형
