A sorting technique which uses the binary tree concept such that label of any node is larger than all the labels in the subtrees, is called ................
A. Selection sort
B. Insertion sort
C. Heap sort
D. Quick sort
Answer:C
A sorting technique which uses the binary tree concept such that label of any node is larger than all the labels in the subtrees, is called ................
A. Selection sort B. Insertion sort C. Heap sort D. Quick sort
Explanation: A Sorting technique which uses the binary tree concept such that label of any node is larger than all the, labels in the sub trees, is called Heap sort because heap sort works on a complete binary tree with the property that the value at any node 'N' of the tree should be greater than or equal to the value at all its children nodes.