(5) Given an unbalanced rooted tree, how would you replace each node's value with the sum of all the values in its subtree that are smaller than the node's value? - Quora

(5) Given an unbalanced rooted tree, how would you replace each node's value with the sum of all the values in its subtree that are smaller than the node's value? - Quora

Given an unbalanced rooted tree, how would you replace each node's value with the sum of all the values in its subtree that are smaller than the node's value?

Frequently asked in

Given an unbalanced rooted tree, how would you replace each node's value with the sum of all the values in its subtree that are smaller than the node's value?

Update

://T

CancelUpdate

Example
Input:

1 2 3

.              60              /    \             50    10...

 (more)

Example
Input:

1 2 3 4 5 6 7

.              60              /    \             50    10            /   \          80    70           |          40

Output:

1 2 3 4 5 6 7

.                   100                   /    \                  40     0                 /  \               40    0                |               0

Read full article from (5) Given an unbalanced rooted tree, how would you replace each node's value with the sum of all the values in its subtree that are smaller than the node's value? - Quora