Find the sum of all left leaves in a given binary tree.
There are two left leaves in the binary tree, with values 9 and 15 respectively. Return 24.
For tree traversal, think in recursion way first. The point is to catch the left leaves. So the base case includes catching a left leaf. Then just recursively call itself on both left subtree and right subtree to find all the left leaves.