This question was previously asked in

ISRO Scientist CS 2015 Official Paper

- K
^{2} - K - 1
- K + 1
- √K

Option 2 : K - 1

The correct answer is **"option 2".**

__CONCEPT:__

**B-tree **is a **self-balancing search tree** that allows all **operations** i.e. searching, insertion, deletion in **logarithmic(log)** time.

__Key Points__

A **B-tree** of **order m** must satisfy the following** properties:**

- Every node can have
**maximum**.*m*children - Every
**internal node**(except root) can have**at least ⌈**nodes.*m*/2⌉ child - The
**root**, if not a leaf node, can have**at least two**children. - An
**internal node**withcontains*k*children.*k*− 1 key - All
**leaf**nodes must be at the**same level.**

**Hence, if a node has K children in B tree, then the node contains exactly k-1 keys.**

India’s **#1 Learning** Platform

Start Complete Exam Preparation

Daily Live MasterClasses

Practice Question Bank

Mock Tests & Quizzes

Trusted by 2,17,41,453+ Students

Testbook Edu Solutions Pvt. Ltd.

1st & 2nd Floor, Zion Building,

Plot No. 273, Sector 10, Kharghar,

Navi Mumbai - 410210

[email protected]
Plot No. 273, Sector 10, Kharghar,

Navi Mumbai - 410210

Toll Free:1800 833 0800

Office Hours: 10 AM to 7 PM (all 7 days)