pre-order traversal

pre-order traversal

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.
The node chain obtained through a pre-order traversal of the rd-MST yields the lowest value (among the three traversal algorithms) for the round of first node failure in all the four scenarios.
Among the tree traversal algorithms, PEGASIS chain constructed based on pre-order traversal resulted in the largest energy loss per node and the PEGASIS chain constructed based on post-order traversal yielded the lowest energy loss per node.
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.