Gate CS-2003 Question Paper With Solutions

Q. 77 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)

Gate CS-2003 Question Paper With Solutions

(B)

Gate CS-2003 Question Paper With Solutions

(C)

Gate CS-2003 Question Paper With Solutions

(D) None of the above

Answer: (B)

Explanation:

Gate CS-2003 Question Paper With Solutions

Learn More:   Gate EE-2004 Question Paper With Solutions

LEAVE A REPLY

Please enter your comment!
Please enter your name here