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