Encyclopedia

in-order traversal

in-order traversal

traverse
This article is provided by FOLDOC - Free Online Dictionary of Computing (foldoc.org)
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.
Use of tree traversal algorithms for chain formation in the PEGASIS data gathering protocol for wireless sensor networks
Copyright © 2003-2025 Farlex, Inc Disclaimer
All content on this website, including dictionary, thesaurus, literature, geography, and other reference data is for informational purposes only. This information should not be considered complete, up to date, and is not intended to be used in place of a visit, consultation, or advice of a legal, medical, or any other professional.