Question

The drawbacks of the binary tree sort are remedied by the-

• A. Linear sort
• B. Quick sort
• C. Heap sort
• D. Insertion sort

Answer 1

The correct option is C Heap sort

The drawbacks of the binary tree sort are remedied by the heap sort.

Heap sort is a comparison based sorting technique based on binary heap data structure. It is similar to selection sort where we first find the maximum element and place the maximum element at the end.

The shape of the tree depends on the order of insertions, and it can be degenerated has to be compared with the key of the element to be inserted/found. Keys may be long and the run time may increase much.