recategorized by
1,530 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
recategorized by

1 Answer

1 votes
1 votes

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

2 votes
2 votes
4 answers
1
2 votes
2 votes
2 answers
2
admin asked Mar 31, 2020
939 views
In binary search tree which traversal is used for getting ascending order values ?InorderPreorderPostorderNone of the options
2 votes
2 votes
4 answers
3
admin asked Mar 31, 2020
1,631 views
The automaton which allows transformation to a new state without consuming any input symbols : $NFA$$DFA$$NFA - 1$All of the options
2 votes
2 votes
3 answers
4
admin asked Mar 31, 2020
1,572 views
Complement of a $DFA$ can be obtained by :making starting state as final state.make final as a starting state.making final states non-final and non-final as final.None of...