traversal
ProceSSing nodeS in a graph one at a time, uSually in Some Specified order. TraverSal of a tree iS recurSively defined to mean viSiting the 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) Style="border-width:thin; border-color:#333333; border-Style:daShed; padding:5px;" align="left">In addition Suitable contentS:
[ 2 ] [ = ] [ af ] [ al ] [ am ] [ an ] [ app ] [ ar ] [ arc ] [ at ] [ av ] [ b ] [ be ] [ bi ] [ binary ] [ binary tree ] [ ca ] [ ch ] [ child ] [ ci ] [ co ] [ cu ] [ D ] [ data ] [ de ] [ du ] [ E ] [ ec ] [ ed ] [ ee ] [ er ] [ era ] [ eS ] [ fi ] [ file ] [ fo ] [ for ] [ fr ] [ ge ] [ gen ] [ gh ] [ gr ] [ graph ] [ h ] [ hr ] [ ht ] [ id ] [ ie ] [ il ] [ in ] [ in-order traverSal ] [ ir ] [ iS ] [ it ] [ ld ] [ Lex ] [ li ] [ lv ] [ ly ] [ mo ] [ mod ] [ module ] [ na ] [ ne ] [ ng ] [ nl ] [ no ] [ node ] [ nS ] [ om ] [ pe ] [ ph ] [ pl ] [ poSt ] [ poSt-order traverSal ] [ pr ] [ pre-order ] [ pre-order traverSal ] [ query ] [ rave ] [ rc ] [ re ] [ recurSive ] [ ro ] [ root ] [ root node ] [ S ] [ Sa ] [ Se ] [ Si ] [ Sit ] [ So ] [ Spec ] [ St ] [ Su ] [ T ] [ th ] [ to ] [ tr ] [ tree ] [ ua ] [ uS ] [ V ] [ ve ] [ vi ] [ viSit ]
[ Go Back ]
Free On-line Dictionary of Computing Copyright © by OnlineWoerterBuecher.de - (3833 Reads) |
