Binary Heaps can be used as priority queues, as the root of a binary tree is always the largest/highest value.