The smallest number of keys that will force a B-Tree of order 3 to have a height 3 is:

  • Home
  • Blog
  • The smallest number of keys that will force a B-Tree of order 3 to have a height 3 is:
About

The smallest number of keys that will force a B-Tree of order 3 to have a height 3 is:

in C and CPP 

1.6. The smallest number of keys that will force a B-Tree of order 3 to have a height 3 is:
A) 12
B) 10
C) 7
D) none of the above

Leave a Reply