Describe B plus tree

Briefly describe the term B+ tree? Elucidate its uses?

E

Expert

Verified

B+ tree represents the manner of insertion, retrieval and removal of nodes in a sorted fashion. Every operation is identified by ‘key’. B+ tree has maximum and minimum bounds on number of keys in each index segment, dynamically. All the records in a B+ tree is persisted at last level, that is, leaf level in the order of keys.

B+ tree is employed to visit the nodes starting from the root to the left or / and right sub tree. Or starting from the first node of leaf level. A bi directional tree traversal is probable in the B+ tree.

   Related Questions in Data Structure & Algorithms

©TutorsGlobe All rights reserved 2022-2023.