B+ TREES
The B+ tree is almost identical to the binary search tree. It is a balanced tree where the search is directed through internal nodes. The data entries are present in the leaf nodes of the B+ tree. B+ trees support both random and sequential access since the leaf nodes are […]
You must be logged in to post a comment.