Heapsort – What is a heap? (2)

• The heap structure can be formalized:

  • a heap is a binary tree
  • if a node n has any children, m1 and m2, then m1 ≤ n and m2 ≤ n

• This is a heap: