0
$\begingroup$

I'm trying to prove that given a min heap with n distinct number with at least 3 nodes, that the median can be found in every level.

I thought about trying to break the heap into to heaps according to the sons and maybe shoe that the median can be found in either, but quite stuck.

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.