## Help authour, Buy PDF Ebook
>>>**Click Here**<<<

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

Question 1 |

2-3 tree is a specific form of .....

B - tree | |

B+ - tree | |

AVL tree | |

Heap |

**Biology Questions answers**

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

between (n/2) and (n/3) | |

(n/6) | |

between (n) and log2(n + 1) | |

between log3(n + 1) and log2(n + 1) |

**English grammar Questions answers**

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?

Splay tree | |

AA tree | |

Heap | |

Red - Black tree |

**ICT Questions answers**

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?

unordered lists | |

binary search tree | |

treap | |

2-3 tree |

**EVS Questions answers**

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.

True | |

False |

**English literature Questions answers**

There are 5 questions to complete.