How is the right, root, left order traversal called in a binary search tree? 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?
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.