Fruits

Answer: d) A data structure that allows elements to be inserted at one end and removed from the other end

Explanation: A queue is a data structure that follows the First-In-First-Out (FIFO) principle, meaning that the element that is inserted first will be the first to be removed. It allows elements to be inserted at one end (rear end) and removed from the other end (front end).

Answer: d) Binary queue

Explanation: A binary queue is not a type of queue in data structure. Instead, it is a term used in computer science to describe a data structure that is similar to a binary heap.

Answer: b) Finding the shortest path between two nodes in a graph

Explanation