How to prove that if same size blocks are allocated to B trees and B+ trees then:-
No. of index nodes in B tree >= No. Of index nodes in B+ tree
In a B+ tree, it is an only key field and block pointer(not record pointer) and since block pointer points to only block whereas record pointer points block as well as record, so block pointer is less than the size of record pointer.