Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
- Height of Binary Tree After Subtree Removal Queries
Coding
- All Nodes Distance K in Binary Tree
Coding · Binary Tree · Breadth-First Search · Depth-First Search
- Amount of Time for Binary Tree to Be Infected
Coding · Binary Tree · Breadth-First Search · Depth-First Search
- Average of Levels in Binary Tree
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 2773. Height of Special Binary Tree
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source