The B-tree is really a generalization of the binary look for tree in that a node in a B-Tree is permitted to have much more than two children. B-Tree indices help discover information promptly by successively narrowing down knowledge by examining ranges of values saved from the node keys (nodes inside the index incorporate keys and tips that could