Help in the code

#1
#2

u can u do it using level order traversal… in base case u check if root is NULL return 0…
now u check if left child of current root exists and that left child is a leaf node then u add its value and recursively check in other subtree…
refer this code https://ide.codingblocks.com/s/590883

#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.