1302. Deepest Leaves Sum
Medium
Given the root
of a binary tree, return the sum of values of its deepest leaves.
Example 1:
Example 2:
Constraints:
The number of nodes in the tree is in the range
[1, 10^4]
.1 <= Node.val <= 100
解題
Runtime: 51 ms, faster than 95.7%
Memory Usage: 7.9 MB, less than 71.13%
Previous1299. Replace Elements with Greatest Element on Right SideNext1304. Find N Unique Integers Sum up to Zero
Last updated