Deepest Leaves Sum - LeetCode
Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared…leetcode.com 문제 내용 가장 깊은 level의 노드들의 합을 구하는 문제 Example 1: Input: root = [1,2,3,4,5,null,6,7,null,null,null,null,8]
Output: 15 Example 2: Input: root = [6,7,8,2,7,1,3,9,null,1,4,null,null,null,5]
Output: 19 Constraints: The number of nodes in the tree is in the range [1, 10^4].