![]() It should also be noted that the nodes at the leaf level are linked with each other, hence making the traversal of the data pointers easy and more efficient.ī+ trees come in handy when we want to store a large amount of data in the main memory. B+ trees reduce this drawback by simply storing the data pointers at the leaf node level and only storing the key values in the internal nodes. We know that B trees allow both the data pointers and the key values in internal nodes as well as leaf nodes, this certainly becomes a drawback for B trees as the ability to insert the nodes at a particular level is decreased thus increase the node levels in it, which is certainly of no good. A B+ tree is an extension of a B tree which makes the search, insert and delete operations more efficient.
0 Comments
Leave a Reply. |