Question: Prove that a heap of height h contains at least 2 h1 elements but less than 2 h ele ments.
Prove that a heap of height h contains at least 2h–1 elements but less than 2h ele ments.
Step by Step Solution
3.47 Rating (154 Votes )
There are 3 Steps involved in it
Heap is a complete binary tree where every node satisfies the heap property either min heap or max h... View full answer
Get step-by-step solutions from verified subject matter experts
