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

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

 Question 1
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
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
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
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