Class Solution
java.lang.Object
g2601_2700.s2673_make_costs_of_paths_equal_in_a_binary_tree.Solution
2673 - Make Costs of Paths Equal in a Binary Tree.<p>Medium</p>
<p>You are given an integer <code>n</code> representing the number of nodes in a <strong>perfect binary tree</strong> consisting of nodes numbered from <code>1</code> to <code>n</code>. The root of the tree is node <code>1</code> and each node <code>i</code> in the tree has two children where the left child is the node <code>2 * i</code> and the right child is <code>2 * i + 1</code>.</p>
<p>Each node in the tree also has a <strong>cost</strong> represented by a given <strong>0-indexed</strong> integer array <code>cost</code> of size <code>n</code> where <code>cost[i]</code> is the cost of node <code>i + 1</code>. You are allowed to <strong>increment</strong> the cost of <strong>any</strong> node by <code>1</code> <strong>any</strong> number of times.</p>
<p>Return <em>the <strong>minimum</strong> number of increments you need to make the cost of paths from the root to each <strong>leaf</strong> node equal</em>.</p>
<p><strong>Note</strong>:</p>
<ul>
<li>A <strong>perfect binary tree</strong> is a tree where each node, except the leaf nodes, has exactly 2 children.</li>
<li>The <strong>cost of a path</strong> is the sum of costs of nodes in the path.</li>
</ul>
<p><strong>Example 1:</strong></p>
<p><img src="https://assets.leetcode.com/uploads/2023/04/04/binaryytreeedrawio-4.png" alt="" /></p>
<p><strong>Input:</strong> n = 7, cost = [1,5,2,2,3,3,1]</p>
<p><strong>Output:</strong> 6</p>
<p><strong>Explanation:</strong> We can do the following increments:</p>
<ul>
<li>Increase the cost of node 4 one time.</li>
<li>Increase the cost of node 3 three times.</li>
<li>Increase the cost of node 7 two times.</li>
</ul>
<p>Each path from the root to a leaf will have a total cost of 9.</p>
<p>The total increments we did is 1 + 3 + 2 = 6.
It can be shown that this is the minimum answer we can achieve.</p>
<p><strong>Example 2:</strong></p>
<p><img src="https://assets.leetcode.com/uploads/2023/04/04/binaryytreee2drawio.png" alt="" /></p>
<p><strong>Input:</strong> n = 3, cost = [5,3,3]</p>
<p><strong>Output:</strong> 0</p>
<p><strong>Explanation:</strong> The two paths already have equal total costs, so no increments are needed.</p>
<p><strong>Constraints:</strong></p>
<ul>
<li><code>3 <= n <= 10<sup>5</sup></code></li>
<li><code>n + 1</code> is a power of <code>2</code></li>
<li><code>cost.length == n</code></li>
<li><code>1 <= cost[i] <= 10<sup>4</sup></code></li>
</ul>
-
Constructor Summary
Constructors -
Method Summary
-
Constructor Details
-
Solution
public Solution()
-
-
Method Details
-
minIncrements
public int minIncrements(int n, int[] cost)
-