Leetcode 110. Balanced Binary Tree

Check whether a binary tree is height-balanced, i.e., for every node the heights of its left and right subtrees differ by at most one. With up to 5000 nodes, this requires efficiently computing subtree heights and verifying the balance condition for all nodes.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 110. Balanced Binary Tree

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact