Available question text
Given a complete binary tree, return its node count in less than O(n) time by exploiting the tree’s completeness (all full levels except a left-filled last level) to compute subtree heights and identify/count perfect subtrees without visiting every node.
Related questions
Continue with questions that share topics or the same question type.
- Count Good Nodes in Binary Tree
Coding
- All Nodes Distance K in Binary Tree
Coding · Binary Tree · Breadth-First Search · Depth-First Search
- Binary Tree Nodes
Coding
- Closest Nodes Queries in a Binary Search 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 · 2 records
Amazon
Leetcode 222. Count Complete Tree Nodes
Reported Nov 12, 2024 · 1 source report
JUNIOR
Source snapshot: Nov 12, 2026
View sourceGoogle
Leetcode 222. Count Complete Tree Nodes
Reported Dec 25, 2024 · 1 source report
MID_LEVEL
Source snapshot: Nov 12, 2026
View source