When a queue is implemented using a circular array, removal from the rear is ____. A) O(n) B) O(1) C) O(n²) D) O(log n)

Name: When a queue is implemented using a circular array, removal from the rear is ____. A) O(n) B) O(1) C) O(n 2 ) D) O(log n)
Brand: Quizplus
Rating: 4.9 (32 reviews)

Question

Quizplus · Accepted Answer

In a circular array implementation of a queue, removal (and addition) of elements at the front (or rear, depending on the implementation) is O(1) because it involves updating the front or rear pointer and does not require shifting elements.

When a Queue Is Implemented Using a Circular Array, Removal