What process adds an item of data awaiting processing to a queue?

Enqueue is the correct term used to describe the process of adding an item of data to a queue. A queue operates under the first-in, first-out (FIFO) principle, meaning that the first item added to the queue will be the first one to be processed or removed. When an item is enqueued, it is placed at the end of the queue, signaling that it is waiting to be processed.

In contrast, the other options refer to different types of data structures or operations. Pop refers to removing an item from a stack, where the most recently added item is removed first, which is known as last-in, first-out (LIFO). Dequeue, on the other hand, refers to the process of removing an item from the front of the queue. Lastly, push is used in the context of stacks, signifying the addition of an item to the top of the stack. Thus, enqueue specifically describes the action of adding an item to a queue, making it the correct answer in this context.