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

Problem Description

Find the sum of all left leaves in a given binary tree.

Example:

    3
   / \
  9  20
    /  \
   15   7

There are two left leaves in the binary tree, with values 9 and 15 respectively. Return 24.

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

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