pub type HeapFn<T> = fn(&T, &T) -> bool;
returns true if left and right elements should be swapped for min_heap fn(1, 2) == false, fn(2, 1) == true