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?