655 views

1 Answer

Best answer
0 votes
0 votes
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.
selected by

Related questions

0 votes
0 votes
1 answer
2
iarnav asked Dec 15, 2017
1,366 views
Does values in Leaf nodes of B+ tree repeats or ever leaf node has an unique value?
1 votes
1 votes
1 answer
3
Arnabi asked Oct 28, 2017
789 views
Given a data file with 100 records per page and 1000 pages and on indexpage capacity of 512 index entries, how deep should be the B+ tree toindex this file.please explain...