[1] : The Free On-line Dictionary of Computing (27 SEP 03)

balanced tree
     
         an optimisation of a tree which aims to keep
        equal numbers of items on each subtree of each node so as to
        minimise the maximum path from the root to any leaf node.
        as items are inserted and deleted, the tree is restructured to
        keep the nodes balanced and the search paths uniform.  such an
        algorithm is appropriate where the overheads of the
        reorganisation on update are outweighed by the benefits of
        faster search.
     
        a b-tree is a kind of balanced tree that can have more
        than two subtrees at each node i.e. one that is not
        restricted to being a binary tree.
     
        2000-01-10
     
     
see also:
tree subtree leaf node algorithm b-tree balanced tree 
binary tree 

Balanced >> B Words
Balanced, definition of term: Balanced
balanced_pag1.html

Cypress Tree >> C Words
Cypress Tree, definition of term: Cypress Tree
cypress+tree_pag1.html

Christmas Tree >> C Words
Christmas Tree, definition of term: Christmas Tree
christmas+tree_pag1.html

Chinaberry Tree >> C Words
Chinaberry Tree, definition of term: Chinaberry Tree
chinaberry+tree_pag1.html

Cherry Tree >> C Words
Cherry Tree, definition of term: Cherry Tree
cherry+tree_pag1.html

Elder Tree >> E Words
Elder Tree, definition of term: Elder Tree
elder+tree_pag1.html

Family Tree >> F Words
Family Tree, definition of term: Family Tree
family+tree_pag1.html

Fir Tree >> F Words
Fir Tree, definition of term: Fir Tree
fir+tree_pag1.html

Fig Tree >> F Words
Fig Tree, definition of term: Fig Tree
fig+tree_pag1.html

Fever Tree >> F Words
Fever Tree, definition of term: Fever Tree
fever+tree_pag1.html

Page 1 2 3 Next