In chapter 25 on the priority queue you said in reference to the heap data structure:
All heap operations are O(log n) except extracting the min value from a min priority heap is a lightning-fast O(1). Likewise, extracting the max value from a max priority heap is also O(1).
Since extracting the highest priority value from a heap requires sifting down, shouldn’t this be O(log n)?