Given a Binary Tree of size **N**, your task is to complete the function **left****LeafSum()**, that should return the sum of all the leaf nodes that are left child of their parent of the given binary tree.

Example:

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

**Input:**

The function takes a single arguments as input, the reference pointer to the **root** of the binary tree.

There are **T** test cases and for each test case the function will be called separately.

**Output:**

The function should return the sum of all the left leaf nodes of the binary tree.

**Constraints:**

1<=T<=100

0<=N<=100

**Example:
Input:**

2

2

1 2 L 1 3 R

5

10 20 L 10 30 R 20 40 L 20 60 R 30 90 L

2

130

**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.

Author: harshitsidhwa

If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.

narahc321 | 170 |

agness | 163 |

lonecoder | 153 |

2016uec1342 | 142 |

HuHu | 140 |

lonecoder | 1088 |

nikhil_sojan | 1082 |

KshatriyaYash | 1066 |

mazumderrohit8 | 928 |

SumitSingh27 | 832 |

blackshadows | 5327 |

Ibrahim Nash | 5215 |

akhayrutdinov | 5111 |

mb1973 | 4504 |

Quandray | 4444 |

Login to report an issue on this page.