Available question text
Find all subtree sizes that form perfect binary trees (every internal node has two children and all leaves are at the same depth) in a given binary tree, then return the k-th largest size or -1 if fewer than k such subtrees exist.
Related questions
Continue with questions that share topics or the same question type.
- Height of Binary Tree After Subtree Removal Queries
Coding
- Kth Largest Sum in a Binary Tree
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
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 3319. K-th Largest Perfect Subtree Size in Binary Tree
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source