1. Engineering
  2. Computer Science
  3. prove that every heap with n entries has exactly n2...

Question: prove that every heap with n entries has exactly n2...

Question details

3. Prove that every heap with n entries has exactly n/2 leaves (Hint: consider first the case in which n is odd, and then the case in which n is even. 1

Solution by an expert tutor
Blurred Solution
This question has been solved
Subscribe to see this solution