2-3 Tree

Choose difficulty:

Beginner

Intermediate

Advanced

1. What is the special or unique property of a 2-3 Tree that makes it different from a normal Binary search tree?

a: Each internal node has either 2 or 3 children Explanation

Explanation

b: Each leaf node has either 2 or 3 children Explanation

Explanation

c: They guarantee a O(n) worst case time complexity Explanation

Explanation

d: Root node has 5 children Explanation

Explanation

2. All leaf nodes of a 2-3 tree are on the same level.

a: True Explanation

Explanation

b: False Explanation

Explanation

3. How are Insertion and Deletion processes in a 2-3 tree different from those in a binary search tree?

a: We need not implement searching in order to do Insertion or Deletion in a 2-3 tree. Explanation

Explanation

b: Insertion and Deletion processes in a 2-3 tree may also involve other operations like merging, splitting, and redistribution of the elements in the tree. Explanation

Explanation

c: False. Insertion and Deletion processes are the same in both 2-3 trees and binary search trees. Explanation

Explanation

4. Searching in a 2-3 tree is different from searching in a binary search tree.

a: True Explanation

Explanation

b: False Explanation

Explanation

Community Links Sakshat Portal Outreach Portal FAQ: Virtual Labs

AGPL 3.0 & Creative Commons (CC BY-NC-SA 4.0)