NIELIT 2017 DEC Scientific Assistant A - Section B: 21

Question

The $2-3-4$ tree is a self-balancing data structure, which is also called :

• A. $2-4$ tree
• B. $B+$ tree
• C. $B-$ tree
• D. None of the options

Comments

2-3-4 tree is B tree  and it is commonly in used for data dictionary.

Answer 1

Option A

 a 2–3–4 tree (also called a 2–4 tree) is a self-balancing data structure that is commonly used to implement dictionaries. The numbers mean a tree where every node with children (internal node) has either two, three, or four child nodes:

• a 2-node has one data element, and if internal has two child nodes;
• a 3-node has two data elements, and if internal has three child nodes;
• a 4-node has three data elements, and if internal has four child nodes;

• 

  2-node

• 

  3-node

• 

  4-node

for more details https://en.wikipedia.org/wiki/2%E2%80%933%E2%80%934_tree