Question

>
MCQ Challenge
Question 6.
Suppose there is a B tree of order 'k', how many keys will the nodes of this tree contain, if the node is not a root node?
Answer:
0 Maximum (k-1)/2 keys
O Minimum (k-1)/2 keys
O Exactly (k-1)/2 keys
0
None of the above​

Answer 1

Answer:

Minimum k-1/2 keys

Explanation:

Thank my answer and mark me as brainist

Answer 2

given : There is a B tree of order 'k'.

We have to find how many keys will the nodes of this tree contain, if the node is not a root node.

We know that,

Every node except root must contain at least (ceiling)([t-1]/2) keys.

The root may contain minimum 1 key. All nodes (including root) may contain at most t – 1 keys.

Here, we have given that there is a B tree of order 'k'

So, The tree contains 0 Maximum (k-1)/2 keys.