LINKED QUEUE OBJECT Introduction Introduction again, the problem with the previous example of queues is that we are working on a list, which is limiting in its size again, the problem with the previous example of queues is that we are working on a list, which is limiting in its size using circular array can be inefficient if too many adds made before deletes (items overwritten) using circular array can be inefficient if too many adds made before deletes (items overwritten) just as with stacks and lists, we can link the queue to take advantage of virtual unlimited memory just as with stacks and lists, we can link the queue to take advantage of virtual unlimited memory but we lose dynamic access of queue elements but we lose dynamic access of queue elements 1) still need two indexes (represented as pointers now): 1) still need two indexes (represented as pointers now): front: where we take from the list front: where we take from the list back: where we add to the list back: where we add to the list 2) also, a number to keep track of the current size of list 2) also, a number to keep track of the current size of list
{}