Given a Binary Tree, check if all leaves are at same level or not.
Input: 1 / \ 2 3 Output: 1 Explanation: Leaves 2 and 3 are at same level.
Input: 10 / \ 20 30 / \ 10 15 Output: 0 Explanation: Leaves 10, 15 and 30 are not at same level.
You dont need to read input or print anything. Complete the function check() which takes root node as input parameter and returns true/false depending on whether all the leaf nodes are at the same level or not.
Expected Time Complexity: O(N)
Expected Auxiliary Space: O(height of tree)
1 ≤ N ≤ 10^3
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.