Leaf at same level
Easy Accuracy: 49.76% Submissions: 33957 Points: 2

Given a Binary Tree, check if all leaves are at same level or not.

Example 1:

          /   \
         2     3

Output: 1

Leaves 2 and 3 are at same level.

Example 2:

          /    \
        20      30
       /  \        
     10    15

Output: 0

Leaves 10, 15 and 30 are not at same level.

Your Task: 
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

We are replacing the old Disqus forum with the new Discussions section given below.
Click here to view old Disqus comments.

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?


All Submissions

My Submissions:

Login to access your submissions.

Leaf at same level

Output Window