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

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

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

in C and CPP 

1.7 The smallest number of keys that will force a B- tree of order 3 have a height 3 is:
A) 12
B) 10
C) 7
D) None of the above

Leave a Reply