Consider the following 2-3-4 tree (i.e., B-tree with a minimum degree of two)…
GATE · 2003 · CS
Consider the following 2-3-4 tree (i.e., B-tree with a minimum degree of two) in which each data item is a letter. The usual alphabetical ordering of letters is used in constructing the tree.
What is the result of inserting G in the above tree ?
- A.
A
- B.
B
- C.
C
- D.
None of the above
Attempted by 219 students.
Sign up free to check your answer
Sign up freeLoading lesson…