How to solve this prob

#1

how to solve this prob

#2

Hi @mahroosanwar0901_2642b14836027bbf,
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.

For implementation difficulty refer https://ide.codingblocks.com/s/654116?_ga=2.195207404.1349480821.1650699623-564174853.1650699623

#3

mark as resolved… :slightly_smiling_face::+1:

#4

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.