Answer to Question #198296 in C++ for Nadeem Shah

Question

Implement a Heap ADT using Binary Tree.

In main function, declare an array of N (10 < N < 30) elements and fill it with random numbers between 1 and 100. Then fill heap with these number and then remove all items by displaying them on screen (heap sort demonstration). 

Answer 1

Dear Nadeem Shah, your question requires a lot of work, which neither of our experts is ready to perform for free. We advise you to convert it to a fully qualified order and we will try to help you. Please click the link below to proceed: Submit order