|All-time Popular Problems|
|Delete Middle of Linked List|
|Find all four sum numbers|
|Find first set bit|
|Element with left side smaller and right side greater|
|Smallest Positive missing number|
|Intersection Point in Y Shapped Linked Lists|
|Largest Number formed from an Array|
|Reverse an Array|
Given a Binary Tree of size N, your task is to complete the function minLeafSum(), that should return the sum of all the leaf nodes that are at minimum level of the given binary tree.
Input : 1 / \ 2 3 / \ \ 4 5 8 / \ 7 2 Output : sum = 5 + 8 = 13
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.
The function should return the sum of all the leaf nodes that are at the minimum level of the binary tree.
1 2 L 1 3 R
10 20 L 10 30 R 20 40 L 20 60 R 30 90 L