If you find anything incorrect or you feel that there is any better approach to solve the above problem, please write comment.
__________________________________________________

Traverse given binary tree using pre order traversal. If current node is left leaf node, then add it’s value to variable sum of left node of binary tree. If current node is not a left leaf node then recursively calculate the sum of left leaf nodes of binary tree in left and right sub tree and return.