# 2-3 Tree Multiple choice Questions and Answers (MCQs)

## Click on any option to know the CORRECT ANSWERS

 Question 1
2-3 tree is a specific form of .....
 A B - tree B B+ - tree C AVL tree D Heap
Microbiology Study questions

Question 1 Explanation:
The 2-3 trees is a balanced tree. It is a specific form the B - tree. It is B - tree of order 3, where every node can have two child subtrees and one key or 3 child subtrees and two keys.

 Question 2
The height of 2-3 tree with n elements is .....
 A between (n/2) and (n/3) B (n/6) C between (n) and log2(n + 1) D between log3(n + 1) and log2(n + 1)
English grammar Study questions

Question 2 Explanation:
The number of elements in a 2-3 tree with height h is between 2h - 1 and 3h - 1. Therefore, the 2-3 tree with n elements will have the height between log3(n + 1) and log2(n + 1).

 Question 3
Which of the following the BST is isometric with the 2-3 tree?
 A Splay tree B AA tree C Heap D Red - Black tree
Economics Study questions

Question 3 Explanation:
AA tree is isometric of the 2-3 trees. In an AA tree, we store each node a level, which is the height of the corresponding 2-3 tree node. So, we can convert a 2-3 tree to an AA tree.

 Question 4
Which of the following data structure can provide efficient searching of the elements?
 A unordered lists B binary search tree C treap D 2-3 tree
Visual arts Study questions

Question 4 Explanation:
The average case time for lookup in a binary search tree, treap and 2-3 tree is O(log n) and in unordered lists it is O(n). But in the worst case, only the 2-3 trees perform lookup efficiently as it takes O(log n), while others take O(n).

 Question 5
LLRB maintains 1-1 correspondence with 2-3 trees.
 A True B False