# Binary Tree Sort Multiple choice Questions and Answers (MCQs)

## Binary Tree Sort Multiple choice Questions and Answers (MCQs)

 Question 6 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
Binary tree sort is an in-place sorting algorithm.
 A True B False
Question 6 Explanation:
In binary tree sort it is required to reserve one tree node for each array element. Its implementation requires two pointer variables for each node. So, it requires extra memory. The worst case space complexity of binary tree sort is θ(n). Therefore, binary tree sort is not an in-place sorting algorithm.

 Question 7 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
Which of the following is false?
 A Binary tree sort and quick sort have same running time B Binary tree sort used BST as work area C As the number of elements to sort gets larger, binary tree sort gets more and more efficient D Both quick sort and binary tree are in place sorting algorithms
Question 7 Explanation:
Binary tree sort and quick sort have same running time i.e O(nlogn)

in average case and O(n2) in worst case. Binary tree is not in-place sorting algorithm.

 Question 8 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
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
Question 8 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.

 Question 9 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
Consider the following statements related to the binary tree sort.