arrow_back Back to Challenges

#110 Balanced Binary Tree

Easy Acceptance 0%
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

code_blocks
Coding
psychology
Aptitude