4,267 views
0 votes
0 votes
The maximum number of nodes in a B-tree of height h and degree t is(depth of root is 0) :

(A) 2t$^{h}$ – 1

(B) t$^{h}$ – 1

(C) $\frac{t^{h+1} - 1}{t-1}$

(D) $\frac{t^{h} - 1}{t-1}$

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
1
pC asked Jan 13, 2016
885 views
The minimum number of keys in a B+ tree is 3. The maximum number of keys in any non-root node is ____.Solution:min no of keys = ceil ( n/2 ) -13 = ceil (n/2) -1n = 8the k...
3 votes
3 votes
2 answers
3
Xylene asked Oct 12, 2017
4,740 views
What is the maximum number of records that can be indexed in B+ tree of level $4$ ,order $10$ where root is at level $1$ ?As the order of tree is $10$, nodes in the last ...
6 votes
6 votes
1 answer
4
firki lama asked Jan 14, 2017
5,927 views
which formula should we use for calculating LEAF node in B+ tree?I. n*(K+r)+b<=block sizewhere n=no of keysk=key size,r=record pointer,b=block pointerII. (n-1)(K+r)+b<=bl...