Add all greater values to node in BST

Add all greater values to node in BST

  October 04, 2017    

---

Idea is to use Inorder traversal in modified way as
Right Root Left 

And all values to a variable and add that variable to every node.

Code:

 int val=0;
    void modify(Node root)
    {
if(root==null)
return;
modify(root.right);
root.data+=val;
val=root.data;
modify(root.left);
    }