Answer:
Explanation:
We start from the bottom-most and rightmost internal node of min Heap and then heapify all internal modes in the bottom-up way to build the Max heap.
To build a heap, the following algorithm is implemented for any input array.
BUILD-HEAP(A)
heapsize := size(A)
for i := floor(heapsize/2) downto 1
do HEAPIFY(A, i)
end for
Convert the given array of elements into an almost complete binary tree.
Ensure that the tree is a max heap.
Check that every non-leaf node contains a greater or equal value element than its child nodes.
If there exists any node that does not satisfy the ordering property of max heap, swap the elements.
Start checking from a non-leaf node with the highest index (bottom to top and right to left).
Answer:
A. a collection of organized data.
Explanation:
It can be a data source, or a database, an excel sheet. or access database. However, it must be well-formatted and hence organized. filtering of data is not necessary, as well as it is not any barrier to the number of the set of data, or the data being sorted. Unsorted data is also fine, and multiple set of data is also fine. It must be known that a data source can be formed from multiple sets of data through the query. And the resultant data source can be used by the mail merge. However, the data source must be a collection of organized data. Hence, A is the correct answer.
