B+ tree Nodes of trees are 80% Full


#1

22448150_345757945835210_8000472579930706866_n


#2

As it is a 4 level B+ Tree, so basically there are 4 levels in the B+ Tree ( level 0, level 1, level 2, level 3)

Order Of Internal Node = 30
80% full. So, (80/100)*30 = 24

Order of Leaf Node = 25
80% full. So, (80/100)*25 = 20

Now let’s solve it.

level 0 will have 24 pointers to level 1.
level 1 will have 24*24 pointers to level 2.
level 2 will have 24*24*24 pointers to level 3.
level 3 will have 24*24*24*20 index records or record pointers.

So ans is 24*24*24*20 = 276480