Word:

balanced tree

(algorithm)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).
Browse
balance of international payments
balance of payments
balance of power
Balance of torsion
balance of trade
Balance rudder
balance sheet
Balance thermometer
Balance valve
Balance wheel
balance-of-payments problem
Balanceable
balanced
balanced budget
balanced computing
balanced diet
-- balanced tree --
Balanced valve
Balancement
Balancer
Balancereef
Balanchine
balancing
Balanidae
Balaniferous
Balanite
balanitis
Balanoglossus
Balanoid
balanoposthitis
Balanus
Balanus balanoides
Balarama
Definitions Index: # A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

About this site and copyright information - Online Dictionary Home - Privacy Policy