Balanced tree
balanced tree
algorithm
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)
Read Also:
- Balancer
a person or thing that balances. entomology, halter2 . an acrobat, rope-dancer, or tumbler. contemporary examples almost all asian nations want america as the balancer and protector against an increasingly demanding beijing. obama’s next headache leslie h. gelb november 2, 2010 historical examples in the long run honour, confound it, got a bit of a […]
- Balancing act
noun a circus act in which a performer displays his or her balancing ability a situation requiring careful balancing of opposing groups, views, or activities: a delicate balancing act between greek and turkish interests contemporary examples like writing, kayaking is all a balancing act, a one-man show of force and skill. 3 must reads: ‘kayak […]
- Balano-
balano- balano- or balan- pref. glans p-n-s or glans cl-toridis: balanitis.
- Balanoid
shaped like an acorn.
- Balanoposthitis
balanoposthitis balanoposthitis bal·a·no·pos·thi·tis (bāl’ə-nō-pŏs-thī’tĭs) n. inflammation of the glans p-n-s and the prepuce.