title: Does inorder in reverse also classify as inorder?
body: <p>I know inorder traversal works like this:</p>
  
  <ol>
  <li>Traverse the left subtree.</li>
  <li>Visit the root.</li>
  <li>Traverse the right subtree.</li>
  </ol>
  
  <p>But what if we have an algorithm that does the following</p>
  
  <ol>
  <li>Traverse the right subtree.</li>
  <li>Visit the root.</li>
  <li>Traverse the left subtree.</li>
  </ol>
  
  <p>Would such a tree traversal be consdered inorder as well?</p>