Okay so I have to write a program that inputs an array and doesheapsort with tre

Question

Okay so I have to write a program that inputs an array and doesheapsort with trees recursively (it has to be trees and it has touse recursion even though the prof said there were more efficientways to do heapsort)...I am pretty sure I know how to do it after Iget the tree set up but what does the code look like to set up thetree? Worded differently, how do you set up a complete (ornearly complete) binary tree given an array of comparables? Iget the feeling that this is intended to be the easy parthahaha

So that's my main question and just as an aside I don't reallyunderstand the purpose of tree iterators

Explanation / Answer

Okay so I have to write a program that inputs an array and doesheapsort with tre

Related Questions

Navigate

• Browse (All)
• Browse O
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.