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

DOWNLOAD FREE PDF <<CLICK HERE>>

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%%


Your answers are highlighted below.
Question 1 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER]
Which of the following is not the self balancing binary search tree?
A
AVL Tree
B
2-3-4 Tree
C
Red - Black Tree
D
Splay Tree
Question 1 Explanation: 
2-3-4 Tree is balanced search trees. But it is not a binary tree. So, it is not a self balancing binary tree. AVL tree, Red-Black Tree and Splay tree are self balancing binary search tree.

Question 2 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER]
The binary tree sort implemented using a self - balancing binary search tree takes ..... time is worst case.
A
O(n log n)
B
O(n)
C
O(n2)
D
O(log n)
Question 2 Explanation: 
The worst case running time of the binary tree sort is O(n2). But, the worst case running time can be improved to the O(n log n) using a self - balancing binary search tree.

Question 3 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER]
An AVL tree is a self - balancing binary search tree, in which the heights of the two child sub trees of any node differ by .....
A
At least one
B
At most one
C
Two
D
At most two
Question 3 Explanation: 
In an AVL tree, the difference between heights of the two child sub trees of any node is at most one. If the height differs by more than one, AVL tree performs rotations to balance the tree.

Question 4 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER]
Associative arrays can be implemented using .....
A
B-tree
B
A doubly linked list
C
A single linked list
D
A self balancing binary search tree
Question 4 Explanation: 
Associative arrays can be implemented using a self balancing binary search tree as the worst-case time performance of self - balancing binary search trees is O(log n).

Question 5 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER]
Self - balancing binary search trees have a much better average-case time complexity than hash tables.
A
True
B
False
Question 5 Explanation: 
For lookup, insertion and deletion hash table take O(1) time in average-case while self - balancing binary search trees takes O(log n). Therefore, hash tables perform better in average-case.

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

DOWNLOAD FREE PDF <<CLICK HERE>>