**Objective: **Given a binary tree, find the sum of all the nodes which are left as well as leaves nodes.

**Example:**

** **

** **

**Approach**:

- 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.

**Complete Code:**

**Output:**

Sum of left leaves: 21