Problem: Given an integer n, return a list of all possible full binary trees with n nodes. Each node of each tree in the answer must have Node.val == 0. (Similar to problem 894)

Can anyone tell, what should be time complexity for memoized solution as it does not appear to be exponential time complexity, like most people have also highlighted in comments of the solution.