We don't have the base example for priority queue in https://docs.python.org/3.8/library/heapq.html#priority-queue-implementation-notes, We can add something like:

> q = Q.PriorityQueue()
> q.put(10)
> q.put(1)
> q.put(5)
> while not q.empty():
    print q.get()

We may also need to add Notes about the PriorityQueue will block when we use max size 

> q = Q.PriorityQueue(1)
> q.put(10)
> q.put(1) # will block until the Queue is available again.

This doesn't make any sense.  None of those operations are defined for the heapq module, nor is there a maxsize.  The heapq usage notes are about the general concept of ways to implement priority queues.  I suspect your suggestion is conflated with queue.PriorityQueue() which does have put(), get(), and maxsize.

As for the queue docs, I don't think more examples are needed. IMO it would just clutter that part of the docs.