A / \ B CThen post-order would process in the order: B, C, A. Pre-order would go: A, B, C. In-order would go: B, A, C. You can have depth first searches where you visit the children of a child before the siblings of a child. This is most easily done with recursion. You can have breadth first searches where you visit all your children before you visit any of your children’s children. This is usually done with a queue to track unvisited relatives.
|
|
You can get the freshest copy of this page from: | or possibly from your local J: drive (Java virtual drive/mindprod.com website mirror) |
| http://mindprod.com/jgloss/traverse.html | J:\mindprod\jgloss\traverse.html | |
![]() | Please email your feedback for publication,
letters to the editor, errors, omissions, typos, formatting errors, ambiguities, unclear wording,
broken/redirected link reports, suggestions to improve this page or comments to
Roedy Green :
| |
| Canadian Mind Products | ||
| mindprod.com IP:[65.110.21.43] | ||
| view Blog | Your face IP:[38.107.179.211] | |
| Feedback | You are visitor number 12,505. | |