Construct the max heap & Min heap for the following data elements

97, 88, 66, 55, 95, 48, 66, 35, 48, 62, 77, 25

Question 2:

Construct the binary search tree of the following: after construction delete 

11,14, 10, 17, 12, 10, 11, 20, 12, 18, 25, 20, 8, 22, 11, 23

Answer rating: 100% (QA)

C CODE PART 1 MAX HEAP CODE USING STL include using namespace std int main priorityqueue pq Max heap ... View the full answer