A **full binary tree** is a binary tree where each node has exactly 0 or 2 children.\n\nGiven an int `n`, return a list of all possible full binary trees with `n` leaf nodes. Each element of the answer is the root node of one possible tree.\n\n**Example:**\n```\nInput: n = 4\nOutput:\n```\n![](https://s3-lc-upload.s3.amazonaws.com/uploads/2018/08/22/fivetrees.png)\n\nRelated problems:\n* https://leetcode.com/problems/all-possible-full-binary-trees/

A full binary tree is a binary tree where each node has exactly 0 or 2 children.\n\nGiven an int n, return a list of all possible full binary trees with n leaf 