OnlineWoerterBuecher.de
Internes

Lexikon


balanced tree


An optimisation of a ref="module.php?name=Lexikon&file=search&eid=1&query=tree">tree which aims to keep equal numbers of items on each ref="module.php?name=Lexikon&file=search&eid=1&query=subtree">subtree of each node so as to minimise the maximum path from the root to any ref="module.php?name=Lexikon&file=search&eid=1&query=leaf node">leaf node. As items are inserted and deleted, the tree is restructured to keep the nodes balanced and the search paths uniform. Such an ref="module.php?name=Lexikon&file=search&eid=1&query=algorithm">algorithm is appropriate where the overheads of the reorganisation on update are outweighed by the benefits of faster search. A ref="module.php?name=Lexikon&file=search&eid=1&query=B-tree">B-tree is a kind of ref="module.php?name=Lexikon&file=search&eid=1&query=balanced tree">balanced tree that can have more than two subtrees at each node (i.e. one that is not restricted to being a ref="module.php?name=Lexikon&file=search&eid=1&query=binary tree">binary tree). (2000-01-10)

In addition suitable contents:
[ ref="module.php?name=Lexikon&op=content&tid=31">2 ] [ ref="module.php?name=Lexikon&op=content&tid=134">= ] [ ref="module.php?name=Lexikon&op=content&tid=262">ad ] [ ref="module.php?name=Lexikon&op=content&tid=383">af ] [ ref="module.php?name=Lexikon&op=content&tid=411">ai ] [ ref="module.php?name=Lexikon&op=content&tid=433">al ] [ ref="module.php?name=Lexikon&op=content&tid=492">algorithm ] [ ref="module.php?name=Lexikon&op=content&tid=544">am ] [ ref="module.php?name=Lexikon&op=content&tid=592">an ] [ ref="module.php?name=Lexikon&op=content&tid=683">app ] [ ref="module.php?name=Lexikon&op=content&tid=740">ar ] [ ref="module.php?name=Lexikon&op=content&tid=743">arc ] [ ref="module.php?name=Lexikon&op=content&tid=800">as ] [ ref="module.php?name=Lexikon&op=content&tid=894">at ] [ ref="module.php?name=Lexikon&op=content&tid=996">av ] [ ref="module.php?name=Lexikon&op=content&tid=1025">B ] [ ref="module.php?name=Lexikon&op=content&tid=1026">b ] [ ref="module.php?name=Lexikon&op=content&tid=1034">ba ] [ ref="module.php?name=Lexikon&op=content&tid=1181">be ] [ ref="module.php?name=Lexikon&op=content&tid=1269">bi ] [ ref="module.php?name=Lexikon&op=content&tid=1298">binary ] [ ref="module.php?name=Lexikon&op=content&tid=1309">binary tree ] [ ref="module.php?name=Lexikon&op=content&tid=1624">bt ] [ ref="module.php?name=Lexikon&op=content&tid=1629">B-tree ] [ ref="module.php?name=Lexikon&op=content&tid=1695">by ] [ ref="module.php?name=Lexikon&op=content&tid=1724">ca ] [ ref="module.php?name=Lexikon&op=content&tid=2001">ch ] [ ref="module.php?name=Lexikon&op=content&tid=3096">date ] [ ref="module.php?name=Lexikon&op=content&tid=3151">de ] [ ref="module.php?name=Lexikon&op=content&tid=3248">delete ] [ ref="module.php?name=Lexikon&op=content&tid=3752">du ] [ ref="module.php?name=Lexikon&op=content&tid=3896">ed ] [ ref="module.php?name=Lexikon&op=content&tid=3929">ee ] [ ref="module.php?name=Lexikon&op=content&tid=4148">er ] [ ref="module.php?name=Lexikon&op=content&tid=4171">es ] [ ref="module.php?name=Lexikon&op=content&tid=4199">et ] [ ref="module.php?name=Lexikon&op=content&tid=4404">fas ] [ ref="module.php?name=Lexikon&op=content&tid=4497">fi ] [ ref="module.php?name=Lexikon&op=content&tid=4520">file ] [ ref="module.php?name=Lexikon&op=content&tid=4700">fo ] [ ref="module.php?name=Lexikon&op=content&tid=4727">for ] [ ref="module.php?name=Lexikon&op=content&tid=4828">fr ] [ ref="module.php?name=Lexikon&op=content&tid=4989">ga ] [ ref="module.php?name=Lexikon&op=content&tid=5134">gh ] [ ref="module.php?name=Lexikon&op=content&tid=5434">h ] [ ref="module.php?name=Lexikon&op=content&tid=5540">hat ] [ ref="module.php?name=Lexikon&op=content&tid=5675">hm ] [ ref="module.php?name=Lexikon&op=content&tid=5768">hr ] [ ref="module.php?name=Lexikon&op=content&tid=5769">hs ] [ ref="module.php?name=Lexikon&op=content&tid=5931">id ] [ ref="module.php?name=Lexikon&op=content&tid=6013">il ] [ ref="module.php?name=Lexikon&op=content&tid=6064">in ] [ ref="module.php?name=Lexikon&op=content&tid=6413">io ] [ ref="module.php?name=Lexikon&op=content&tid=6482">is ] [ ref="module.php?name=Lexikon&op=content&tid=6558">it ] [ ref="module.php?name=Lexikon&op=content&tid=6789">ke ] [ ref="module.php?name=Lexikon&op=content&tid=6822">ki ] [ ref="module.php?name=Lexikon&op=content&tid=6918">la ] [ ref="module.php?name=Lexikon&op=content&tid=7033">leaf ] [ ref="module.php?name=Lexikon&op=content&tid=7091">Lex ] [ ref="module.php?name=Lexikon&op=content&tid=7463">ma ] [ ref="module.php?name=Lexikon&op=content&tid=8032">mo ] [ ref="module.php?name=Lexikon&op=content&tid=8040">mod ] [ ref="module.php?name=Lexikon&op=content&tid=8079">module ] [ ref="module.php?name=Lexikon&op=content&tid=8228">ms ] [ ref="module.php?name=Lexikon&op=content&tid=8258">mu ] [ ref="module.php?name=Lexikon&op=content&tid=8386">na ] [ ref="module.php?name=Lexikon&op=content&tid=8460">nc ] [ ref="module.php?name=Lexikon&op=content&tid=8472">ne ] [ ref="module.php?name=Lexikon&op=content&tid=8627">ng ] [ ref="module.php?name=Lexikon&op=content&tid=8630">ni ] [ ref="module.php?name=Lexikon&op=content&tid=8675">no ] [ ref="module.php?name=Lexikon&op=content&tid=8680">node ] [ ref="module.php?name=Lexikon&op=content&tid=8760">ns ] [ ref="module.php?name=Lexikon&op=content&tid=8787">nu ] [ ref="module.php?name=Lexikon&op=content&tid=8799">numbers ] [ ref="module.php?name=Lexikon&op=content&tid=8964">om ] [ ref="module.php?name=Lexikon&op=content&tid=9014">op ] [ ref="module.php?name=Lexikon&op=content&tid=9120">org ] [ ref="module.php?name=Lexikon&op=content&tid=9185">overhead ] [ ref="module.php?name=Lexikon&op=content&tid=9204">pa ] [ ref="module.php?name=Lexikon&op=content&tid=9373">path ] [ ref="module.php?name=Lexikon&op=content&tid=9550">ph ] [ ref="module.php?name=Lexikon&op=content&tid=9908">pr ] [ ref="module.php?name=Lexikon&op=content&tid=10144">pt ] [ ref="module.php?name=Lexikon&op=content&tid=10253">query ] [ ref="module.php?name=Lexikon&op=content&tid=10364">rc ] [ ref="module.php?name=Lexikon&op=content&tid=10385">re ] [ ref="module.php?name=Lexikon&op=content&tid=10767">ro ] [ ref="module.php?name=Lexikon&op=content&tid=10789">root ] [ ref="module.php?name=Lexikon&op=content&tid=10887">ru ] [ ref="module.php?name=Lexikon&op=content&tid=10918">S ] [ ref="module.php?name=Lexikon&op=content&tid=10922">sa ] [ ref="module.php?name=Lexikon&op=content&tid=11150">se ] [ ref="module.php?name=Lexikon&op=content&tid=11651">so ] [ ref="module.php?name=Lexikon&op=content&tid=11934">st ] [ ref="module.php?name=Lexikon&op=content&tid=12090">strict ] [ ref="module.php?name=Lexikon&op=content&tid=12109">struct ] [ ref="module.php?name=Lexikon&op=content&tid=12133">su ] [ ref="module.php?name=Lexikon&op=content&tid=12588">th ] [ ref="module.php?name=Lexikon&op=content&tid=12721">to ] [ ref="module.php?name=Lexikon&op=content&tid=12787">tr ] [ ref="module.php?name=Lexikon&op=content&tid=12844">tree ] [ ref="module.php?name=Lexikon&op=content&tid=12939">tw ] [ ref="module.php?name=Lexikon&op=content&tid=12986">ua ] [ ref="module.php?name=Lexikon&op=content&tid=13030">um ] [ ref="module.php?name=Lexikon&op=content&tid=13146">up ] [ ref="module.php?name=Lexikon&op=content&tid=13310">ve ]






Go Back ]

Free On-line Dictionary of Computing

Copyright © by OnlineWoerterBuecher.de - (7292 Reads)

All logos and trademarks in this site are property of their respective owner.

Page Generation in 0.0927 Seconds, with 16 Database-Queries
Zurück zur Startseite