Leetcode 366. Find Leaves of Binary Tree

Given a binary tree, repeatedly remove all current leaf nodes and record their values until the tree is empty, returning a list of lists where each inner list contains the leaves removed in that round. The key challenge is grouping nodes by their removal round (i.e., their height from the bottom), which can be computed via a post-order traversal.