traversal

(redirected from Tree traversal)
Also found in: Dictionary, Thesaurus, Encyclopedia, Wikipedia.
References in periodicals archive ?
Depending on the order in which the vertices are visited, starting with the root vertex, there exist three different types of tree traversal algorithms: pre-order, in-order and post-order traversals.
For sake of clarity, we refer to the version of PEGASIS that uses the node chain obtained from the distance-based greedy heuristic as PEGASIS-original and the versions of PEGASIS that use the node chain obtained from the tree traversal algorithms as PEGASIS-preOrder, PEGASIS-inOrder and PEGASIS-postOrder.
Initially false, turned true when visited // starting from the given structure v, through in order traversal, algorithm visits all the descendant nodes in the ST-tree and augments the d_list begin if ST-outd(v) <> 0 then begin starting from v, in order traversal through ST-tree returns all the descendants of v in ST-tree; descendants obtained by the tree traversal are added to d_list; end; if nst(v) = true and NST-outd(v) <> 0 then begin starting from v, in order traversal through NST-tree returns all the descendants of v in ST-tree; descendants obtained by the tree traversal are added to d_list; end; Returns d_list as the list of descendants for structure v; end;
x] is the tree traversal order by preorder, and where [size.