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:

- Text Justification Problem (OR Word Wrap Problem) Hard
- Breadth-First Search/Traversal in a Binary Tree Beginner
- Binary Tree-Postorder Traversal - Non Recursive Approach Beginner
- Introduction To Backtracking Programming Beginner
- Reverse a given number – Java Code Beginner
- Find the Maximum Depth OR Height of a Binary Tree Beginner
- Dynamic Programming - Count all paths in 2D Matrix with Obstructions in it Medium
- Construct a Binary Tree from Given Inorder and Depth-First-Search. Hard