Question

Which of the following sorting algorithms can be considered as improvement to the binary tree sort?

(a) Heap sort

(b) Quick sort

(c) Selection sort

(d) Insertion sort

This question was addressed to me by my college professor while I was bunking the class.

The origin of the question is Sorting topic in chapter Sorting of Data Structures & Algorithms II

Answer 1

The correct answer is (a) Heap sort

Easiest explanation - Heap sort is basically improvement to the binary tree sort. Heap sort builds a heap on the input element by adjusting the position of the elements within the original array, rather than creating nodes as in binary tree sort.