Geeksforgeeks

Error

×

Leaderboard

Showing:

Handle | Score |
---|---|

@Ibrahim Nash | 6379 |

@blackshadows | 6329 |

@mb1973 | 5358 |

@Quandray | 5231 |

@akhayrutdinov | 5111 |

@saiujwal13083 | 4510 |

@sanjay05 | 3762 |

@marius_valentin_dragoi | 3522 |

@sushant_a | 3459 |

@verma_ji | 3357 |

@KshamaGupta | 3318 |

Complete Leaderboard | |

Handle | Score |

@ritiksethi21 | 1050 |

@aroranayan999 | 807 |

@RizulBansal | 685 |

@ashishtrehan002 | 538 |

@hemantgarg923 | 528 |

@simrangoyal | 526 |

@ronaldo77 | 520 |

@anishrajan | 505 |

@thanosagain | 505 |

@ssparteek470 | 495 |

@rahul2312 | 491 |

Complete Leaderboard |

Given a Binary Tree of size **N. **Find the sum of all the leaf nodes that are left child of their parent of the given binary tree.

**Example 1:**

**Input:
**1
/ \
2 3**
Output: **2

**Example 2:**

**Input** :
1
/ \
2 3
/ \ \
4 5 8
/ \ / \
7 2 6 9
**Output**: 13
**Explanation:
**sum = 6 + 7 = 13

**Your Task:**

You don't need to read input or print anything. Your task is to complete the function **leftLeavesSum()** which takes the root node of the tree as input and returns the sum of all the left leaf nodes present in the given binary tree.

**Expected Time Complexity: **O(N).

**Expected Auxiliary Space: **O(Height of the Tree).

**Constraints:**

1<=Number of nodes<=10^{5}

**Note:**The **Input/Ouput** format and **Example** given are used for system's internal purpose, and should be used by a user for **Expected Output** only. As it is function problem, hence a user should not read any input from stdin/console. The task is to complete the function specified, and not to write the full code.

Login to report an issue on this page.

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

Yes
Sum of Left Leaf Nodes

...