OnlineWoerterBuecher.de
Internes

Lexikon


traversal


Processing ref="module.php?name=Lexikon&file=search&eid=1&query=nodes">nodes in a ref="module.php?name=Lexikon&file=search&eid=1&query=graph">graph one at a time, usually in some specified order. Traversal of a tree is ref="module.php?name=Lexikon&file=search&eid=1&query=recursive">recursively defined to mean visiting the ref="module.php?name=Lexikon&file=search&eid=1&query=root node">root node and traversing its children. Visiting a node usually involves transforming it in some way or collecting data from it. In "pre-order traversal", a node is visited _before_ its children. In "post-order" traversal, a node is visited _after_ its children. The more rarely used "in-order" traversal is generally applicable only to binary trees, and is where you visit first a node' s left child, then the node itself, and then its right child. For the binary tree: T / I S / D E A pre-order traversal visits the nodes in the order T I D E S. A post-order traversal visits them in the order D E I S T. An in-order traversal visits them in the order D I E T S. (2001-10-01)

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=383">af ] [ ref="module.php?name=Lexikon&op=content&tid=433">al ] [ 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=894">at ] [ ref="module.php?name=Lexikon&op=content&tid=996">av ] [ ref="module.php?name=Lexikon&op=content&tid=1026">b ] [ 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=1724">ca ] [ ref="module.php?name=Lexikon&op=content&tid=2001">ch ] [ ref="module.php?name=Lexikon&op=content&tid=2059">child ] [ ref="module.php?name=Lexikon&op=content&tid=2099">ci ] [ ref="module.php?name=Lexikon&op=content&tid=2247">co ] [ ref="module.php?name=Lexikon&op=content&tid=2900">cu ] [ ref="module.php?name=Lexikon&op=content&tid=2976">D ] [ ref="module.php?name=Lexikon&op=content&tid=3006">data ] [ ref="module.php?name=Lexikon&op=content&tid=3151">de ] [ ref="module.php?name=Lexikon&op=content&tid=3752">du ] [ ref="module.php?name=Lexikon&op=content&tid=3834">E ] [ ref="module.php?name=Lexikon&op=content&tid=3865">ec ] [ 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=4150">era ] [ ref="module.php?name=Lexikon&op=content&tid=4171">es ] [ 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=5057">ge ] [ ref="module.php?name=Lexikon&op=content&tid=5070">gen ] [ ref="module.php?name=Lexikon&op=content&tid=5134">gh ] [ ref="module.php?name=Lexikon&op=content&tid=5291">gr ] [ ref="module.php?name=Lexikon&op=content&tid=5307">graph ] [ ref="module.php?name=Lexikon&op=content&tid=5434">h ] [ ref="module.php?name=Lexikon&op=content&tid=5768">hr ] [ ref="module.php?name=Lexikon&op=content&tid=5779">ht ] [ ref="module.php?name=Lexikon&op=content&tid=5931">id ] [ ref="module.php?name=Lexikon&op=content&tid=5956">ie ] [ 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=6161">in-order traversal ] [ ref="module.php?name=Lexikon&op=content&tid=6449">ir ] [ 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=7023">ld ] [ ref="module.php?name=Lexikon&op=content&tid=7091">Lex ] [ ref="module.php?name=Lexikon&op=content&tid=7107">li ] [ ref="module.php?name=Lexikon&op=content&tid=7437">lv ] [ ref="module.php?name=Lexikon&op=content&tid=7441">ly ] [ 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=8386">na ] [ 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=8660">nl ] [ 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=8964">om ] [ ref="module.php?name=Lexikon&op=content&tid=9457">pe ] [ ref="module.php?name=Lexikon&op=content&tid=9550">ph ] [ ref="module.php?name=Lexikon&op=content&tid=9651">pl ] [ ref="module.php?name=Lexikon&op=content&tid=9850">post ] [ ref="module.php?name=Lexikon&op=content&tid=9862">post-order traversal ] [ ref="module.php?name=Lexikon&op=content&tid=9908">pr ] [ ref="module.php?name=Lexikon&op=content&tid=9929">pre-order ] [ ref="module.php?name=Lexikon&op=content&tid=9930">pre-order traversal ] [ ref="module.php?name=Lexikon&op=content&tid=10253">query ] [ ref="module.php?name=Lexikon&op=content&tid=10351">rave ] [ 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=10433">recursive ] [ 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=10793">root node ] [ 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=11376">si ] [ ref="module.php?name=Lexikon&op=content&tid=11506">sit ] [ ref="module.php?name=Lexikon&op=content&tid=11651">so ] [ ref="module.php?name=Lexikon&op=content&tid=11790">spec ] [ ref="module.php?name=Lexikon&op=content&tid=11934">st ] [ ref="module.php?name=Lexikon&op=content&tid=12133">su ] [ ref="module.php?name=Lexikon&op=content&tid=12359">T ] [ 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=12986">ua ] [ ref="module.php?name=Lexikon&op=content&tid=13175">us ] [ ref="module.php?name=Lexikon&op=content&tid=13229">V ] [ ref="module.php?name=Lexikon&op=content&tid=13310">ve ] [ ref="module.php?name=Lexikon&op=content&tid=13366">vi ] [ ref="module.php?name=Lexikon&op=content&tid=13449">visit ]






Go Back ]

Free On-line Dictionary of Computing

Copyright © by OnlineWoerterBuecher.de - (3805 Reads)

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

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