Does inorder in reverse also classify as inorder?

Question

I know inorder traversal works like this:

1. Traverse the left subtree.
2. Visit the root.
3. Traverse the right subtree.

But what if we have an algorithm that does the following

1. Traverse the right subtree.
2. Visit the root.
3. Traverse the left subtree.

Would such a tree traversal be consdered inorder as well?

Answer 1

I was wondering the same thing for some time.

I would say, it can be called inorder traversal also. The result would be reverse sorted array instead of the sorting that would come up with left-root-right.

But the definitions are strict on saying left-root-right.