Documentation

Heap

Maximal heap

Insert: O(n*log(n))

Find max: O(1)

Extract max: O(n*log(n))

Union: O(n^2*log(n))