I think logically we can solve,
Like in B tree consists of both key field and data pointer is stored .
In B+ tree it is only key field and record pointer ( which is considerably less than data pointer value).
So, effective usage of node is improved in B+ tree.