Collect and remove all leaves repeatedly until the tree is empty. Return leaves grouped by collection round.
Given a binary tree, collect all the leaves in the first round, then the leaves of the remaining tree in subsequent rounds, until the tree is empty.
Return the leaves grouped by the round they are collected.