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