Given a BST, modify it so that all greater values in the given BST are added to every node.
Input: 50 / \ 30 70 / \ / \ 20 40 60 80 Output: 350 330 300 260 210 150 80 Explanation:The tree should be modified to following: 260 / \ 330 150 / \ / \ 350 300 210 80
Input: 2 / \ 1 5 / \ 4 7 Output: 19 18 16 12 7
You don't need to read input or print anything. Your task is to complete the function modify() which takes one argument: root of the BST. The function should contain the logic to modify the BST so that in the modified BST, every node has a value equal to the sum of its value in the original BST and values of all the elements larger than it in the original BST. Return the root of the modified BST. The driver code will print the inorder traversal of the returned BST/
Expected Time Complexity: O(N)
Expected Auxiliary Space: O(Height of the BST).
Note: The Input/Output format and Example is given are used for the system's internal purpose, and should be used by a user for Expected Output only. As it is a function problem, hence a user should not read any input from the stdin/console. The task is to complete the function specified, and not to write the full code.
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.