How to find the reverse-inorder successor in a binary search tree

Question

I am fairly new to programming. I\'ve managed to get the inorder successor for any given node in a BST. But I can\'t figure out how to get the successor in case or reverse-inord