Self Balancing Binary Search Tree Multiple choice Questions and Answers (MCQs)
Click on any option to know the CORRECT ANSWERS
Which of the following is not the self balancing binary search tree?
Red - Black 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.
The binary tree sort implemented using a self - balancing binary search tree takes ..... time is worst case.
O(n 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.
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 .....
At least one
At most one
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.
Associative arrays can be implemented using .....
A doubly linked list
A single linked list
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).
Self - balancing binary search trees have a much better average-case time complexity than hash tables.
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.
There are 5 questions to complete.