Geeksforgeeks

Timer is Running

Associated Course(s):
Amazon SDE Test Series

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

**Example 1:**

**Input: **
1
/ \
2 3
**Output:** 1
**Explanation:
**Leaves 2 and 3 are at same level.

**Example 2:**

Input:10 / \ 20 30 / \ 10 15Output:0Explanation: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)

**Constraints:**

1 ≤ N ≤ 10^3

Author: Shubham Joshi 1

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.

Pathak1899 | 436 |

yashdip123 | 380 |

kirtidee18 | 377 |

ykaushik | 261 |

_saswata | 232 |

kirtidee18 | 1057 |

ykaushik | 733 |

aggarwalvatsal5 | 709 |

pmr_3689 | 570 |

harbilassingh | 530 |

blackshadows | 5456 |

Ibrahim Nash | 5450 |

akhayrutdinov | 5111 |

mb1973 | 4976 |

Quandray | 4823 |

Login to report an issue on this page.