If a node has K children in Btree, then the node contains exactly _____ keys.

2015

If a node has K children in Btree, then the node contains exactly _____ keys.

  1. A.

    K2

  2. B.

    K - 1

  3. C.

    K + 1

  4. D.

    K1/2

Attempted by 402 students.

Show answer & explanation

Correct answer: B

In a B-tree, if a node has K children, it contains exactly K-1 keys. This is because each key separates two adjacent child subtrees.

A video solution is available for this question — log in and enroll to watch it.

Explore the full course: Isro