madeeasytestseries#ds

Question

Consider a complete Binary Tree ‘T’ with key of root node be ‘P’. It is given that the left and right subtree of ‘P’
satisfies minheap
property. What is the time taken to convert the given tree ‘T’ to a max heap ?
a. Ο(log n)
b. Ο(n)
c. Ο(n log n)
d. Ο(n2)

Comments

What difference does it make???

---

Yes the answer is right. But what if tree is given it is an array only right??? It is not given pointers are used. How tree is different from array??

---

@Yes, i corrected myself :P