package leetcode;

/**
 * https://leetcode.com/problems/insufficient-nodes-in-root-to-leaf-paths/
 */
public class Problem1080 {
    public static class TreeNode {
        int val;
        TreeNode left;
        TreeNode right;

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

    public TreeNode sufficientSubset(TreeNode root, int limit) {
        // TODO
        return null;
    }

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

@@ -486,24 +486,25 @@
 1080();%0A
+%0A
         
 %0A    %7D%0A%7D
@@ -495,16 +495,1226 @@
         
+TreeNode root = new TreeNode(1);%0A        root.left = new TreeNode(2);%0A        root.left.left = new TreeNode(4);%0A        root.left.left.left = new TreeNode(8);%0A        root.left.left.right = new TreeNode(9);%0A        root.left.right = new TreeNode(-99);%0A        root.left.right.left = new TreeNode(-99);%0A        root.left.right.right = new TreeNode(-99);%0A        root.right = new TreeNode(3);%0A        root.right.left = new TreeNode(-99);%0A        root.right.left.left = new TreeNode(12);%0A        root.right.left.right = new TreeNode(13);%0A        root.right.right = new TreeNode(7);%0A        root.right.right.left = new TreeNode(-99);%0A        root.right.right.right = new TreeNode(14);%0A%0A        root = prob.sufficientSubset(root, 1);%0A%0A        root = new TreeNode(5);%0A        root.left = new TreeNode(4);%0A        root.left.left = new TreeNode(11);%0A        root.left.left.left = new TreeNode(7);%0A        root.left.left.right = new TreeNode(1);%0A        root.right = new TreeNode(8);%0A        root.right.left = new TreeNode(17);%0A        root.right.right = new TreeNode(4);%0A        root.right.right.left = new TreeNode(5);%0A        root.right.right.right = new TreeNode(3);%0A%0A        root = prob.sufficientSubset(root, 22);
 %0A    %7D%0A%7D

Update problem 1080