In a priority queue, elements are dequeued based on their ___________.

In a priority queue, elements are dequeued based on their priority level, where higher-priority elements are dequeued before lower-priority elements. Priority queues are often implemented using heaps to efficiently maintain the highest priority element at the front.