| balanced tree An optimisation of a which aims to keep equal numbers of items on each of each node so as to minimise the maximum path from the root to any . As items are inserted and deleted, the tree is restructured to keep the nodes balanced and the search paths uniform. Such an is appropriate where the overheads of the reorganisation on update are outweighed by the benefits of faster search. A is a kind of that can have more than two subtrees at each node (i.e. one that is not restricted to being a ). (2000-01-10) |
на заглавную 
к началу страницы