In a Binary Search Tree you have the following orders for traversal:

Left, Root, Right is called Inorder (or ascending order).

Root, Left, Right is called Preorder.

Left, Right, Root is called PostOrder.

But how is Right, Root, Left (or descending order) called?

  • 2
    $\begingroup$ Reverse inorder probably. $\endgroup$ Commented Sep 15, 2019 at 16:28

1 Answer 1


As per wikipedia (Tree Traversal), it is called Out-order traversal

Though, you could also find reference to reverse in-order traversal, which means the same.

  • $\begingroup$ I would immediately understand what "reverse in-order traversal" meant. I'd have no idea what "out-order traversal" meant and this is the first time I've ever heard it. $\endgroup$ Commented Sep 16, 2019 at 1:26

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.