Implementation of B-Tree in Java Programming

B-Tree is a tree data structure of the most common used in databases and filesystems, that keeps data sorted and balanced. The idea of B-Tree is an internal node can have a number of child nodes wihtin some pre-defined range. When data is inserted or removed from a node, its number of child nodes changes. In order to maintain the pre-defined range, the internal nodes may be joined or split. Because a range of child nodes is permitted, B-Tree does not need re-balancing as frequently as other self-balancing search tree. However, B-Tree may waste some space, since nodes are not entirely full. The lower and upper bounds on the number of child nodes are typically fixed for a paticular implementation. B-Tree kept balanced by requiring that all leaf nodes at the same height. The height will increase slowly as elements are added to the tree, but an increase in the overall height or depth is infrequent. Because B-Tree is designed to have branches in large numbers and contains a number of keys on each node so that relative tree height small. By maximizing the number of child nodes within each internal node, the height of tree decreases, balancing occursless than often, and efficiency increases