Queue array implementations include:
wasted memory: the array space used to store queue elements can never be used to store queue elements because elements can only be inserted at the front, and frontthe value of may be so large that all the space before that can never be filled.
Array size: If we use an array to implement a queue, it may be necessary to expand the queue to insert more elements in some cases.
Because expanding the array size is nearly impossible, determining the correct array size is always in an array implementation of a queue.
