pre-order traversal

pre-order traversal

This article is provided by FOLDOC - Free Online Dictionary of Computing (foldoc.org)
Mentioned in ?
References in periodicals archive ?
In pre-order traversal, a node is visited first before visiting the nodes in any of its subtrees.
Algorithm for Pre-Order Traversal of the Rooted Directed Minimum-weight Spanning Tree Input: Rooted Directed Tree rd-MST([V.sup.rd], [E.sup.rd]), Root node r-node Output: PreOrder-Sequence Auxiliary Variables: Child-Nodes-List, Sensor node u Initialization: PreOrder-Sequence = [PHI] u [left arrow] r-node Begin PreOrder-Traversal (u) 1.
In INLAB labeling scheme, given an XML tree, any label consists of <self-level:parent> representation, where (i) self is obtained by doing a pre-order traversal of the tree nodes (ii) level of a node is its distance from the root and (iii) parent is the direct node which relates to the self node.
The self attribute is computed based on pre-order traversal the beginning of the XML tree.