post-order traversal

post-order traversal

Mentioned in ?
References in periodicals archive ?
Section 3 introduces our graph theory algorithm to generate a rooted directed minimum-weight spanning tree of the sensor network and describes the execution of the pre-order, in-order and post-order traversal algorithms.
In post-order traversal, we visit the nodes in each subtree of a node before visiting the node itself.
Algorithm for Post-Order Traversal of the Rooted Directed Minimum-weight Spanning Tree Input: Rooted Directed Tree rd-MST([V.
The maximum relative improvement in the round of first node failure can be as large as 30% (obtained for post-order traversal on 100m x 100m network, TDMA system).
In terms of the absolute values, the chain obtained through a post-order traversal of the rd-MST yields the largest value for node lifetime in all the four scenarios shown in Fig.
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.