intermediateDSA & Coding235 of 436
Check if a binary tree is height-balanced
Tests whether you compute height and balance in a single bottom-up pass (returning -1 as an early-exit imbalance signal), instead of a naive solution that recomputes height from scratch at every node.
Ready to master this question?
Generate a complete walkthrough — background, the full answer in plain language, a working code example explained line by line, a real-world scenario, common mistakes, and how this same question gets asked in different ways.
Sign in to generate a response