Get the Sum of all left leaves in a Binary tree

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

Example:

Approach:

1. The approach is quite simple.
2. Do the inorder traversal
3. check if node if the left child and leaf node.
4. If yes then add it to the sum.
5. See the code for more understanding.

Run This Code

Code:

Output:

Sum of left leaves: 21

Also Read:

- Find the Size of the Binary Tree Beginner
- Binary Tree - Preorder Traversal - Non Recursive Approach Beginner
- Backtracking - N Queens Problem Hard
- Generate all the strings of length n from 0 to k-1. Medium
- Convert Binary Tree into Threaded Binary Tree Hard
- Inorder Successor in Binary Tree Medium
- Count All Paths from Top left to bottom right in Two Dimensional Array including Diagonal Paths Medium
- Number of Islands using BFS Medium