In a priority queue, insertion and deletion can be done at
In a typical priority queue, the insertion and deletion operations are specifically designed to maintain the priority order of elements. Therefore, they are typically done at specific positions to ensure that the highest (or lowest) priority element remains at the front or the root.
The correct answer would be: a) Front
D
64.3k questions
77.9k answers
244k comments
80.0k users