deepest-leaves-sum

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

Given the <code>root</code> of a binary tree, return the sum of values of its deepest leaves.
&nbsp;
Example 1:
<img alt="" src="https://assets.leetcode.com/uploads/2019/07/31/1483_ex1.png" style="width: 273px; height: 265px;" />
<pre>
Input: root = [1,2,3,4,5,null,6,7,null,null,null,null,8]
Output: 15
</pre>

Example 2:

<pre>
Input: root = [6,7,8,2,7,1,3,9,null,1,4,null,null,null,5]
Output: 19
</pre>

&nbsp;
Constraints:

<ul>
	<li>The number of nodes in the tree is in the range <code>[1, 104]</code>.</li>
	<li><code>1 &lt;= Node.val &lt;= 100</code></li>
</ul>

deepestLeavesSum

Deepest Leaves Sum

Tree

Depth-First Search

Breadth-First Search

Binary Tree

给你一棵二叉树的根节点 <code>root</code> ，请你返回 层数最深的叶子节点的和 。

 

示例 1：

<img alt="" src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2019/12/28/1483_ex1.png" style="height: 265px; width: 273px;" />

<pre>
输入：root = [1,2,3,4,5,null,6,7,null,null,null,null,8]
输出：15
</pre>

示例 2：

<pre>
输入：root = [6,7,8,2,7,1,3,9,null,1,4,null,null,null,5]
输出：19
</pre>

 

提示：

<ul>
	<li>树中节点数目在范围 <code>[1, 104]</code> 之间。</li>
	<li><code>1 <= Node.val <= 100</code></li>
</ul>