Leetcode 2973. Find Number of Coins to Place in Tree Nodes

For each node in a rooted tree, compute coins = 1 if its subtree has fewer than 3 nodes, otherwise the maximum product of any three distinct costs in that node’s subtree (use 0 if every such product is negative). The core challenge is efficiently aggregating per-subtree extreme cost values to evaluate the best triple for every node.