Leetcode Problem 894. All Possible Full Binary Trees

894. All Possible Full Binary Trees

Leetcode Solutions

Check if n is odd; if not, return an empty list since full binary trees require an odd number of nodes.
If n is 1, return a list containing a single node tree.
If the result for n nodes is already computed, return it from the memoization map.
Initialize an empty list res to store the root nodes of all possible full binary trees with n nodes.
Loop over odd values of i from 1 to n - 1, and for each i, do the following: a. Recursively call the function to get all possible full binary trees with i nodes for the left subtree. b. Recursively call the function to get all possible full binary trees with n - i - 1 nodes for the right subtree. c. For each combination of left and right subtrees, create a new tree with a root node and add it to res.
Store res in the memoization map with key n.
Return res.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen