ocr: Queue Impiemenation of a queue as a linked data structure If (emptyl)) Operations supported: Queue is empty, point the queue head and tail enqueue(x) place iten X at end of queue at the new iten head return item at head of queue qHead = new; dequeue remove next iten from front of queue gTail = new; empty return true iff queue is enpty Else * Data structures - qHead poiater to the head of queue queue is not empty, insert the iten and point qTail pointer to the tail of queue everything - to new; it A qltem queue nemver structure Alail->next * next pointer to next item on. queue gTail - new; 1 an ...
(.png)
