Priority queue based on the structure of 2-3-4 tree structure

Question

Does anyone have any information about priority queuesbased on 2-4 tree structure? I searched all day .. Any links from anyone who knows will be really appreciated. Thank.

Answer 1

• Implement 2-3-4 trees, allowing duplicate keys.
• Use them as priority queues, storing priorities as keys and implementing the minimum (or maximum) retrieve + delete element. The minimum can be found by following the left baby's pointer until it becomes zero.

See also tree sorting .