in Databases recategorized by
620 views
2 votes
2 votes

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

  1. $2-4$ tree
  2. $B+$ tree
  3. $B-$ tree
  4. None of the options
in Databases recategorized by
620 views

1 comment

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

1 Answer

1 vote
1 vote

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

Answer:

Related questions