You are given a tree rooted at node 1 with N nodes ->
Each node "i" has a positive value A[i]

-> In one operation, you may choose any node "u" and decrease the value of every currently alive node in the subtree of u by K

-> If a node’s value becomes ≤ 0, it is removed from the tree, which may split the tree into multiple components.

Determine the minimum number of operations required to remove all nodes from the tree.


You are given a tree rooted at node 1 with N nodes ->
Each node "i" has a positive value A[i]-> In one operation, you may choose any node "u" and decrease the value of every currently alive node in the subtree of u by K-> If a node’s value becomes ≤

Microsoft SDE1 Interview | Tree DSA | Failed | CTC - 51L | 2026 - CS Grad