Which of following statements about heap is wrongA. An n element heap has height log n(base of log is 2)B. Smallest element of heap is always a leafC. An array in reverse sorted order is a heapD. A heap can't contain any element more than once

Showing Answers 1 - 1 of 1 Answers

saravanan

  • Aug 2nd, 2005
 

answer d:

  Was this answer useful?  Yes

Give your answer:

If you think the above answer is not correct, Please select a reason and add your answer below.

 

Related Answered Questions

 

Related Open Questions