Binary Heaps as a Priority Queue

We can have max and min priority queues based on the heap used (max or min heap)
Binary heaps take efficient time in operation INSERT and EXTRACT MIN compared to other Data Structures as Array, List