terminal
Elevo
/
ESC
Login
Initiate Registration
code
Topics
corporate_fare
Companies
history
History
arrow_back
Back to Challenges
#110
Balanced Binary Tree
Easy
Acceptance 0%
Editorial
description
Problem Description
Given a binary tree, determine if it is height-balanced. A height-balanced binary tree is a binary tree in which the depth of the two subtrees of every node never differs by more than one.
checklist
Constraints
See problem description for detailed constraints.
science
Examples
Case #1
In:
# See problem description for input format
Out:
# Expected output
Mastery Tags
Recursion
Trees
Hiring Companies
Goldman Sachs
Salesforce
code
Integrated IDE
Python 3
expand_more
C
C++ 17
Java
JavaScript
Python 3
C
C++ 17
Java
JavaScript
Python 3
refresh
class Solution: def balancedBinaryTree(self, *args): # Write your solution here pass
Login to Compile
Processing
terminal
Debug Output
home
Home
extension
Practice
robot_2
login
Sign In
account_circle
Menu
code_blocks
Coding
psychology
Aptitude
Navigation
close
Login
Registration