Build your intuition. Fill in the missing part by typing it in.
The two fundamental operations of a queue are: __ and __.
Enqueue: This operation adds an element to the rear end of the queue. The enqueue operation is also known as insertion.
Dequeue: This operation removes an element from the front end of the queue. The dequeue operation is also known as deletion.
It's important to note that both enqueue and dequeue operations have a time complexity of O(1) in a basic array implementation of a queue.
Write the missing line below.