Objective: Given a binary tree, find the sum of all the nodes which are left as well as leaves nodes.
- The approach is quite simple.
- Do the inorder traversal
- check if node if the left child and leaf node.
- If yes then add it to the sum.
- See the code for more understanding.
Sum of left leaves: 21