Vidyalelo
Data Structure · Q43

Trees in Data Structures

Programming · Data Structure · question 43

Q43

In a B-Tree, what is the minimum number of keys in a non-root node?

A.
⌈t/2⌉ - 1 where t is the minimum degree
Answer
B.
⌈t/2⌉
C.
⌈t/2⌉ + 1
D.
t - 1

Answer: Option A

Solution

Answer: Option A
No explanation is given for this question Let's Discuss on Board