Available question text
Given a binary tree, simulate the process of repeatedly removing all current leaf nodes and recording their values until the tree is empty. Return a list of lists where each inner list contains the leaf node values removed in that round. The key insight is that nodes can be grouped by their 'height from the bottom' (i.e., their removal round), which can be computed efficiently via a post-order traversal.
Related questions
Continue with questions that share topics or the same question type.
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 · 5 records
Amazon
Leetcode 366. Find Leaves of Binary Tree
Reported Dec 7, 2024 · 1 source report
MID_LEVEL
Source snapshot: Nov 12, 2026
View sourceeBay
Leetcode 366. Find Leaves of Binary Tree
Reported Jul 24, 2026 · 1 source report
SENIOR
Source snapshot: Nov 12, 2026
View sourceGoogle
Leetcode 366. Find Leaves of Binary Tree
Reported Dec 25, 2024 · 2 source reports
JUNIOR, MID_LEVEL
Source snapshot: Nov 12, 2026
View sourceLinkedIn
Leetcode 366. Find Leaves of Binary Tree
Reported Apr 2, 2026 · 3 source reports
JUNIOR, SENIOR
Source snapshot: Nov 12, 2026