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:

- Dynamic Programming - Longest Common Subsequence Medium
- Tree Traversals Beginner
- Minimum No of operations required to convert a given number to 1 - Integer Replacement Problem. Medium
- Print All The Nodes Which are X distance from the Root Medium
- Dynamic Programming - Coin Change Problem Medium
- Print the Bottom View of the Binary Tree. Medium
- Level Order Traversal, Print each level in separate line. Medium
- Populate Next Siblings Pointers in a Given Binary Tree OR Populate Next Right Pointers in Each Node Hard