mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-10-26 07:18:56 +08:00
24 lines
744 B
HTML
24 lines
744 B
HTML
Given the <code>root</code> of a binary tree, return <em>the sum of values of its deepest leaves</em>.
|
|
<p> </p>
|
|
<p><strong>Example 1:</strong></p>
|
|
<img alt="" src="https://assets.leetcode.com/uploads/2019/07/31/1483_ex1.png" style="width: 273px; height: 265px;" />
|
|
<pre>
|
|
<strong>Input:</strong> root = [1,2,3,4,5,null,6,7,null,null,null,null,8]
|
|
<strong>Output:</strong> 15
|
|
</pre>
|
|
|
|
<p><strong>Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> root = [6,7,8,2,7,1,3,9,null,1,4,null,null,null,5]
|
|
<strong>Output:</strong> 19
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li>The number of nodes in the tree is in the range <code>[1, 10<sup>4</sup>]</code>.</li>
|
|
<li><code>1 <= Node.val <= 100</code></li>
|
|
</ul>
|