Replace sum with greater nodes

#1


Respected Sir/Mam
Actually my code is working and all test cases are also passing but my main doubt is about my approach. Am I using correct approach to solve it?
please help !

#2

you have shared empty coe link but We can do it using a single traversal. The idea is to use following BST property. If we do reverse Inorder traversal of BST, we get all nodes in decreasing order. We do reverse Inorder traversal and keep track of the sum of all nodes visited so far, we add this sum to every node.

#3

sir sorry about the link

#4

here is the link of the code https://onecompiler.com/java/3wz8hv43b

#5

sir, I have understood your approach but please check that whether i have used the correct approach or not??

#6

yes, your approach is correct