How is the right, root, left order traversal called in a binary search tree?

Question

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?

$\begingroup$ Reverse inorder probably. $\endgroup$ – Hendrik Jan Sep 15 at 16:28 — Hendrik Jan, Sep 15 at 16:28

TheCommonEngineer · Accepted Answer · 2019-09-15 19:09:30Z

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.

answered Sep 15 at 19:09

TheCommonEngineer

861 bronze badge

$\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$ – Derek Elkins Sep 16 at 1:26

add a comment |

1 Answer 1