@@ -0,0 +1,1171 @@
+package leetcode;%0A%0A/**%0A * https://leetcode.com/problems/populating-next-right-pointers-in-each-node/%0A */%0Apublic class Problem116 %7B%0A    public static class TreeLinkNode %7B%0A        int val;%0A        TreeLinkNode left, right, next;%0A%0A        TreeLinkNode(int x) %7B%0A            val = x;%0A        %7D%0A    %7D%0A%0A    public void connect(TreeLinkNode root) %7B%0A%0A    %7D%0A    %0A    public static void main(String%5B%5D args) %7B%0A        Problem116 prob = new Problem116();%0A        %0A        TreeLinkNode root = new TreeLinkNode(1);%0A        root.left = new TreeLinkNode(2);%0A        root.right = new TreeLinkNode(3);%0A        root.left.left = new TreeLinkNode(4);%0A        root.left.right = new TreeLinkNode(5);%0A        root.right.left = new TreeLinkNode(6);%0A        root.right.right = new TreeLinkNode(7);%0A        %0A        prob.connect(root);%0A        %0A        for (TreeLinkNode node = root.left; node != null; node = node.next) %7B%0A            System.out.println(node.val);%0A        %7D%0A        System.out.println(%22-------------------------------------------------%22);%0A        for (TreeLinkNode node = root.left.left; node != null; node = node.next) %7B%0A            System.out.println(node.val);%0A        %7D%0A    %7D%0A%7D%0A

Create a skeleton for problem 116