I'm somewhat confused about the Wikipedia terms about the meaning of 'reversed' in the context of tree & graph treversals
Suppose I have a tree:
1
/ \
/ \
/ \
/ \
2 3
/ \ /
4 5 6
/ \ / \
7 8 9 10
Tree traversal article describes reversed traversal as going right-to-left as opposed to left-to-right;
so according to it the tree has preorder traversal
1 2 4 7 8 5 3 6 9 10
and reverse preorder traversal
1 3 6 10 9 2 5 4 8 7
However, the DFS article describes reverse orderings as just the reversed version of a usual one (while left-to-right vs. right to-left is AFAIU left undefined);
so according to this article both of the above are preorderings, while
10 9 6 3 5 8 7 4 2 1 is the reverse preordering for the 1st one, and
7 8 4 5 2 9 10 6 3 1 is the reverse preordering for the 2nd one.
(I realize the last two are the two post-order traversals in the first article's sense.)
So, are there two different terminologies in contexts of trees and general graphs respectively? Isn't there a mistake in some of these articles?
If there's no mistake, then, if asked to find a reverse preorder of a given graph (tree), I guess I should clarify which meaning of 'reverse' a person implies, right?