반응형
1302. Deepest Leaves Sum

소스 코드는 여기 있습니다. 문제는 여기 있습니다. Problem Given the root of a binary tree, return the sum of values of its deepest leaves. Example 1: Input: root = [1,2,3,4,5,null,6,7,null,null,null,null,8] Output: 15Example 2: Input: root = [6,7,8,2,7,1,3,9,null,1,4,null,null,null,5] Output: 19Constraints: The number of nodes in the tree is in the range [1, 10^4]. 1 test(TreeNode.of(6, 7, 8, 2, 7, 1, 3, 9, null, 1,..
Algorithm/LeetCode Daily Challenge 2022. 5. 27. 10:30
반응형
1