@@ -0,0 +1,499 @@
+package leetcode;%0A%0A/**%0A * https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/%0A */%0Apublic class Problem106 %7B%0A    public static class TreeNode %7B%0A        int val;%0A        TreeNode left;%0A        TreeNode right;%0A%0A        TreeNode(int x) %7B%0A            val = x;%0A        %7D%0A    %7D%0A%0A    public TreeNode buildTree(int%5B%5D inorder, int%5B%5D postorder) %7B%0A        return null;%0A    %7D%0A%0A    public static void main(String%5B%5D args) %7B%0A        Problem106 prob = new Problem106();%0A    %7D%0A%7D%0A

Create a skeleton for problem 106