LeetCode – Find Leaves of Binary Tree (Java)

Given a binary tree, collect a tree’s nodes as if you were doing this: Collect and remove all leaves, repeat until the tree is empty. Example: Given binary tree 1 / \ 2 3 / \ 4 5 Returns [4, 5, 3], [2], [1]. Java Solution 1 Naively, we can get the order of each … Read more