edited by
3,684 views
1 votes
1 votes

For any B-tree of minimum degree t $\geq$ 2, every node other than the root must have at least ____ keys and every node can have at most ____ keys.

  1. t-1, 2t+1
  2. t+1, 2t+1
  3. t-1, 2t-1
  4. t+1, 2t-1
edited by

1 Answer

Best answer
1 votes
1 votes

In B tree every internal node other than the root is at least half-full,

i.e. t-1≤ #keys ≤2t-1,

t≤ #children ≤2t

Hence,Option(C)t-1 , 2t-1.

Reference:-http://www2.hawaii.edu/~milica/ics311/B-Trees.doc

selected by
Answer:

Related questions

2 votes
2 votes
2 answers
1
go_editor asked Jul 26, 2016
3,161 views
Big-O estimate for $f(x)=(x+1) \log(x^2 +1) + 3x^2 $ is given as$O(x \log x)$$O(x^2)$$O(x^3)$$O(x^2 \log x)$
4 votes
4 votes
2 answers
2
go_editor asked Jul 25, 2016
8,246 views
Given two sorted list of size 'm' and 'n' respectively. The number of comparisons needed in the worst case by the merge sort algorithm will bem $\times$ nmax(m, n)min(m, ...
1 votes
1 votes
1 answer
3
go_editor asked Jul 26, 2016
2,870 views
Linux operating system usesAffinity schedulingFair Preemptive SchedulingHand ShakingHighest Penalty Ratio Next