Please enable JavaScript.

Coggle requires JavaScript to display documents.

Heaps and Heapsort - Coggle Diagram

- - - - finding an item with the highest (i.e., largest) priority
      - deleting an item with the highest priority
        
        O(log n)
      - adding a new item to the multiset
  - - - Elements not know beforehand
      - Elements inserted one-by-one
      - Heapify after each insertion
      - Worst temporal efficiency of each insertion in O(log n)
      - Worst temporal efficiency of heap Creation in O(n log n)
    - - Worst temporal efficiency of heap Creation in O(n)
      - Elements known beforehand
      - All elements inserted at once
      - Heapify from the last to the first internal node
- - - - Bottom-up creation in O(n)
      - Each deletion in O(log n)