Given the following tree:
Which traversal method would give as result the following output: CDBEA?
The answer in my study guide is Postorder, but I think postorder would output: DEBCA. Am I wrong?
$\begingroup$
$\endgroup$
4
-
3$\begingroup$ Which book are you referencing? "The book" does not make sense without context. $\endgroup$– Dave ClarkeMay 18, 2012 at 18:50
-
$\begingroup$ In fact is a study guide and this is a question that's why there is no context $\endgroup$– Jorge ZapataMay 18, 2012 at 18:51
-
$\begingroup$ This is random traversal :) what is the usage? $\endgroup$– user742May 18, 2012 at 18:52
-
2$\begingroup$ The question is fine (though it might be better to generalize it a little bit so it is more useful for others also), it is a normal question a CS student might ask. $\endgroup$– KavehMay 18, 2012 at 21:16
Add a comment
|
1 Answer
$\begingroup$
$\endgroup$
3
You are not wrong.
A postorder traversal visits the left subtree, then the right subtree, then the root of the current tree (recursively).
answered May 18, 2012 at 18:53
-
$\begingroup$ perfect I just wanted to be sure, thanks $\endgroup$ May 18, 2012 at 18:54
-
2$\begingroup$ Unordered children could explain why C comes first, but not the position of B. $\endgroup$– Raphael ♦May 18, 2012 at 20:27
-
$\begingroup$ I can't make sense of the traversal CDBEA. Is this just random? If not, what sort of traversal is being used? $\endgroup$ May 19, 2012 at 13:09