# Self Balancing Binary Search Tree Multiple choice Questions and Answers (MCQs)

## Self Balancing Binary Search Tree Multiple choice Questions and Answers (MCQs)

Congratulations - you have completed Self Balancing Binary Search Tree Multiple choice Questions and Answers (MCQs).

You scored %%SCORE%% out of %%TOTAL%%.

Your performance has been rated as %%RATING%%

 Question 6 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER]
Which of the following is a self - balancing binary search tree?
 A 2-3 tree B Threaded binary tree C AA tree D Treap
Question 6 Explanation:
An AA tree, which is a variation of red-black tree, is a self - balancing binary search tree. 2-3 is B-tree of order 3 and Treat is a randomized binary search tree. A threaded binary tree is not a balanced tree.

 Question 7 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER]
A self - balancing binary search tree can be used to implement .....
 A Priority queue B Hash table C Heap sort D Priority queue and Heap sort
Question 7 Explanation:
Self-balancing binary search trees can be used to construct and maintain ordered lists, to achieve the optimal worst case performance. So, self - balancing binary search tree can be used to implement a priority queue, which is ordered list.

 Question 8 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER]
In which of the following self - balancing binary search tree the recently accessed element can be accessed quickly?
 A AVL tree B AA tree C Splay tree D Red - Black tree
Question 8 Explanation:
In a Splay tree, the recently accessed element can be accessed quickly. In Splay tree, the frequently accessed nodes are moved towards the root so they are quick to access again.

 Question 9 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER]
The minimum height of self balancing binary search tree with n nodes is .....
 A log2(n) B n C 2n + 1 D 2n - 1
Question 9 Explanation:
Self - balancing binary trees adjust the height by performing transformations on the tree at key insertion times, in order to keep the height proportional to log2(n).

 Question 10 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER]
Binary tree sort implemented using a self balancing binary search tree takes O(n log n) time in the worst case but still it is slower than merge sort.
 A True B False
Question 10 Explanation:
The worst case performance of binary tree sort is O(n log n) when it is implemented using a self balancing binary search tree. Self balancing binary search trees perform transformations to balance the tree, which caused balancing overhead. Due to this overhead, binary tree sort is slower than merger sort.

Once you are finished, click the button below. Any items you have not completed will be marked incorrect.
There are 10 questions to complete.