Get the Sum of all left leaves in a Binary tree by SJ · December 6, 2015 Objective: Given a binary tree, find the sum of all the nodes which are left as well as leaves nodes. Example: Get the Sum of all left leaves in a Binary tree. 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:Run This Code Run This Code Output: Sum of left leaves: 21 __________________________________________________ Top Companies Interview Questions..- Google Microsoft Amazon Facebook more.. If you find anything incorrect or you feel that there is any better approach to solve the above problem, please write comment. __________________________________________________ Related Posts:Convert Binary Tree into Threaded Binary TreeIntroduction to Threaded Binary TreeConvert BST to Greater Sum TreeDouble Threaded Binary Tree Complete ImplementationTop 25 Interview Problems on Binary Trees/Binary Search TreesSingle Threaded Binary Tree Complete ImplementationGraph – Depth First TraversalHeap Sort – Java ImplementationSwap Nodes in pairs in a Linked List by changing linksDjkstra’s – Shortest Path Algorithm (SPT)Share this:LinkedInGooglePrintTumblrFacebookTwitterEmailRedditLike this:Like Loading...