A sorting mechanism uses the binary tree concept such that any number in the tree is
larger than all the numbers in the sub-tree below it. What is this method called?
selection sort
insertion sort
heap sort
quick sort
Answers
Answered by
7
Answer:
The method is called heap sort.
Explanation:
according to the question A sorting mechanism uses the binary tree concept such that any number in the tree is
larger than all the numbers in the sub-tree below.
The heap sort is used to find the largest element and put it in the last. It uses the concept of binary tree.
Answered by
1
Answer:
Heap sort
Explanation:
Similar questions