Leetcode 894. All Possible Full Binary Trees

Generate all structurally unique full binary trees with n nodes (each node has 0 or 2 children and Node.val == 0). Only odd n can produce solutions, so the task reduces to combinatorially partitioning the remaining nodes between left and right subtrees and combining all valid subtree pairs.