Search
⌘K
Get Premium
Leetcode 2773. Height of Special Binary Tree
Given a binary tree with a restrictive structural property (e.g., complete/perfect), compute its height (number of levels) by exploiting that structure to avoid visiting every node — enabling faster algorithms (e.g., O(log^2 n) or O(log n)) than a naive O(n) traversal.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.