Convert BST to Greater Tree

Question Explain

Given the root of a BST, convert it to a Greater Tree such that every key is changed to the original key plus the sum of all other keys greater than the original key. Use reverse in-order traversal.