conceptuallyheapsort consists of making insertions into heapfollowed by removals heapsort can be made to run faster by applying the trickle-down algorithm directly to / items in the unsorted arrayrather than inserting items the same array can be used for the initial unordered datafor the heap arrayand for the final sorted data thusheapsort requires no extra memory questions these questions are intended as self-test for readers answers may be found in appendix what does the term complete mean when applied to binary treesa all the necessary data has been inserted all the rows are filled with nodesexcept possibly the bottom one all existing nodes contain data the node arrangement satisfies the heap condition what does the term weakly ordered mean when applied to heaps node is always removed from the to "trickle upa node in descending heap means to repeatedly exchange it with its parent until it' larger than its parent to repeatedly exchange it with its child until it' larger than its child to repeatedly exchange it with its child until it' smaller than its child to repeatedly exchange it with its parent until it' smaller than its parent heap can be represented by an array because heap is complete is weakly ordered is binary tree satisfies the heap condition