in-order traversal

in-order traversal

Mentioned in ?
References in periodicals archive ?
In in-order traversal, if a node has m subtrees, we visit the nodes in the first m/2 subtrees, visit the node itself, and then visit the nodes in the remaining m/2 subtrees.
Algorithm for In-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: InOrder-Sequence Auxiliary Variables: Child-Nodes-List, Sensor node u, Half-List-Size Initialization: InOrder-Sequence = [PHI] u [left arrow] r-node Begin InOrder-Traversal (u) 1.