Please enable JavaScript.

Coggle requires JavaScript to display documents.

Heaps and Heapsort, Heapsort - Coggle Diagram

- - - - finding an item with the highest (i.e., largest) priority
      - deleting an item with the highest priority
      - adding a new item to the multiset
  - - - The shape property—the binary tree is essentially complete (or simply complete), i.e., all its levels are full except possibly the last level, where only some rightmost leaves may be missing
      - The parental dominance or heap property—the key in each node is greater than or equal to the keys in its children. (This condition is considered automatically satisfied for all leaves.)