B Tree

 Question 1
If a node has $K$ children in B tree, then the node contains exactly _____ keys.
 A $K^{2}$ B $K-1$ C $K+1$ D $\sqrt{K}$
ISRO CSE 2015   Data Structure
Question 1 Explanation:
 Question 2
A B-tree of order 4 is built from scratch by 10 successive insertions. What is the maximum number of node splitting operations that may take place?
 A 3 B 4 C 5 D 6
GATE CSE 2008   Data Structure
Question 2 Explanation:
 Question 3
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
GATE CSE 2003   Data Structure
Question 3 Explanation:
 Question 4
Choose the correct alternatives (more than one may be correct) and write the corresponding letters only:

A 2-3 tree is such that
a. All internal nodes have either 2 or 3 children
b. All paths from root to the leaves have the same length.

The number of internal nodes of a 2-3 tree having 9 leaves could be
 A 4 B 5 C 6 D 7
GATE CSE 1992   Data Structure
Question 4 Explanation:
There are 4 questions to complete.

2 thoughts on “B Tree”

1. Sir, Please check the option b of 3rd question, there “b” is written in 2 nodes.