A B-tree is a type of balanced tree. A tree is defined as a data structure in which access always begins from the "root node," where a "node" is simply a reference point in the tree, and the "root node" is the only node that has no parent. The end-points of the tree comprise nodes that have no "child nodes," and these are called the "leaves"; nodes that do have child nodes are called "interior nodes." A balanced tree is a special kind of tree where all the leaves are all a similar distance from the root node. Unlike the kind of tree that grows in the ground, data trees are typically represented with the root at the top with the branches fanning out below it.

A B-tree is an efficient means of storing and finding records in a database. The B-tree algorithm minimises the frequency of accesses...