Why is the time complexity for insert O(log N) for a priority queue when it is O(1) for a min heap?

Question

The average time for heap insertion is O(1) and O(log N) for worst case (see here: https://stackoverflow.com/a/39517553/14714339). Since priority queues can be implemented w