depth first, pre-order traversal ?

Pre-order traversal simply means, that any method is applied to the parent first, before it is applied to its children. A tree like

aNode

/

-pNode-+-bNode

\

cNode

would therefor result in a series of method calls like:

pNode.yourMethod();

aNode.yourMethod();

bNode.yourMethod();

cNode.yourMethod();

Whereas post-order taversal would start with the children and process the parent node as last one. Finally a in-order run would process some children first, which come in some kind of order before the parent node, then the root node and finally the remaining children. Of course, that makes only sense if the tree is ordered in some way, eg. if the node content can be ordered alphabetically or so.

Hope that helps,

Mathias

mneumi at 2007-6-29 8:40:59 >