Solving Deepest Leaves Sum in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.

Problem Description

Given 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: 15

Constraints:

See the full details of the problem Deepest Leaves Sum at LeetCode

Originally posted at: @github.com/halfrost/LeetCode-Go