Skip to content
Related Articles

Related Articles

Improve Article

GATE | GATE-CS-2003 | Question 65

  • Last Updated : 28 Jun, 2021

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.
GATECS2003Q65
What is the result of inserting G in the above tree ?

A) GATECS2003Q65A

B) GATECS2003Q65B

C) GATECS2003Q65C

D) None of the above

(A) A
(B) B
(C) C
(D) D


Answer: (B)

Explanation: Since the given B tree is 2-3-4 tree, there can be at-most 4 children or 3 keys.

In B Tree insertion, we start from root and traverse till the leaf node where key is to be inserted. While traversing, if we find a a node which full, we split it. When we insert G, we find root itself is full, so we split it. When we come down to leftmost leaf, we find that the leaf is also full, so we split the leaf also.

Quiz of this Question

Attention reader! Don’t stop learning now.  Practice GATE exam well before the actual exam with the subject-wise and overall quizzes available in GATE Test Series Course.

Learn all GATE CS concepts with Free Live Classes on our youtube channel.

My Personal Notes arrow_drop_up
Recommended Articles
Page :