balanced tree

B b

Transcription

- US Pronunciation
- US IPA

- US Pronunciation
- US IPA

Definition of balanced tree words

noun Technical meaning of 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). 1

Just one definition for balanced tree

Information block about the term

Parts of speech for Balanced tree

noun

adjective

verb

adverb

pronoun

preposition

conjunction

determiner

exclamation

Full grammatical hierarchy of Balanced tree

See also

All definitions of balanced tree

Matching words

Was this page helpful?

Yes No

Thank you for your feedback! Tell your friends about this page

Tell us why?