What is the definition of a balanced treeSolutionBalanced tr

Solution

Balanced tree
An optimisation of a tree which aim to remain equal numbers of items on each sub tree of each node so as to minimise the maximum path from root to any leaf node.As items are inserted and deleted, the tree is re-structured to keep the nodes balanced and the look for path consistent. Such an algorithm is appropriate where the expenses of the re-organisation on update are out weighed by the benefits of faster search.
A B-tree is a kind of balanced tree that can have more than two sub trees at each node i.e. one that is not restricted to being a binary tree .