package leetcode;

import java.util.List;

/**
 * https://leetcode.com/problems/all-possible-full-binary-trees/
 */
public class Problem894 {
    public static class TreeNode {
        int val;
        TreeNode left;
        TreeNode right;

        TreeNode(int x) {
            val = x;
        }
    }

    public List<TreeNode> allPossibleFBT(int N) {
        // TODO
        return null;
    }

    public static void main(String[] args) {
        Problem894 prob = new Problem894();
    }
}

@@ -12,16 +12,44 @@
 tcode;%0A%0A
+import java.util.ArrayList;%0A
 import j
@@ -373,24 +373,148 @@
 BT(int N) %7B%0A
+        List%3CTreeNode%3E result = new ArrayList%3C%3E();%0A        if (N %3C= 2 %7C%7C N %25 2 == 0) %7B%0A            return result;%0A        %7D%0A
         // T
@@ -536,12 +536,14 @@
 urn 
-null
+result
 ;%0A  
@@ -632,20 +632,275 @@
 oblem894();%0A
+        System.out.println(prob.allPossibleFBT(7)); // %5B%5B0,0,0,null,null,0,0,null,null,0,0%5D,%5B0,0,0,null,null,0,0,0,0%5D,%5B0,0,0,0,0,0,0%5D,%5B0,0,0,0,0,null,null,null,null,0,0%5D,%5B0,0,0,0,0,null,null,0,0%5D%5D%0A        System.out.println(prob.allPossibleFBT(6)); // %5B%5D%0A
     %7D%0A%7D%0A

Update problem 894