A balanced order -n mult'way search tree in which each non-root node contains atleast ________ keys is called a B-tree of order n?

n-1

No worries! We‘ve got your back. Try BYJU‘S free classes today!

(n-1)/2

Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses

n/2

No worries! We‘ve got your back. Try BYJU‘S free classes today!

(n-1)2

No worries! We‘ve got your back. Try BYJU‘S free classes today!

Open in App

Solution

The correct option is B (n-1)/2
A balanced order -n multiway search tree in which each non-root node contains at least (n-1)/2 keys is called a B-tree of order n.

B tree is a self-balancing search tree and contains multiple nodes which keep data in sorted order. Each node has 2 or more children and consists of multiple keys.

B-tree is essentially just a sorted list of keys, which are {data, pointer or row locator} combinations. The actual structure of a B-tree consists of a number of nodes stored as items in the B-tree's file. Each node contains a portion of the sorted list of keys in the B-tree, along with pointers to other nodes.

Suggest Corrections

Similar questions

$n^{n} - n (n - 1)^{n} + \frac{n (n - 1)}{2!} (n - 2)^{n} - . . . \infty = \frac{3}{a} \times n!$ .

Find $a$

6

n - \frac{n (n - 1) (n - 2)}{⌊ 3} \cdot 3 + \frac{n (n - 1) (n - 2) (n - 3) (n - 4)}{⌊ 5} \cdot 3^{2} - . . . . .,

n - \frac{n (n - 1) (n - 2)}{⌊ 3} \cdot \frac{1}{3} + \frac{n (n - 1) (n - 2) (n - 3) (n - 4)}{⌊ 5} \cdot \frac{1}{3^{2}} - . . . . .,

\frac{2^{n} (n + 1)^{n}}{n^{n}}

n

n^{n + 1} - n {(n - 1)}^{n + 1} + \frac{n (n - 1)}{2!} {(n - 2)}^{n + 1} - \dots = \frac{1}{2} n (n + 1)!

n^{n} - (n + 1) {(n - 1)}^{n} + \frac{(n + 1) n}{2!} {(n - 2)}^{n} - \dots = 1

n

1^{n} - n 2^{n} + \frac{n (n - 1)}{1 \cdot 2} 3^{n} - \dots = {(- 1)}^{n} n!

{(n + p)}^{n} - n {(n + p - 1)}^{n} + \frac{n (n - 1)}{2!} {(n + p - 2)}^{n} - \dots = n!

n + 1

Join BYJU'S Learning Program