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

It will still be an inorder traversal. Inorder is simetrical.

From wikipedia:

To traverse a non-empty binary tree in
inorder (symmetric), perform the
following operations recursively at
each node:

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

Reference.