@@ -0,0 +1,886 @@
+/**%0A * https://leetcode.com/problems/binary-tree-inorder-traversal/%0A *%0A */%0A%0A%0A%0A/**%0A * Definition for a binary tree node.%0A * public class TreeNode %7B%0A *     int val;%0A *     TreeNode left;%0A *     TreeNode right;%0A *     TreeNode(int x) %7B val = x; %7D%0A * %7D%0A */%0Apublic class Solution %7B%0A    public List%3CInteger%3E inorderTraversal(TreeNode root) %7B%0A        Stack%3CTreeNode%3E stack = new Stack%3CTreeNode%3E();%0A        TreeNode currNode = root;%0A        %0A        List%3CInteger%3E res = new ArrayList%3CInteger%3E();%0A        while(currNode != null %7C%7C !stack.empty()) %7B%0A            while(currNode != null) %7B%0A                stack.push(currNode);%0A                currNode = currNode.left;%0A            %7D%0A            %0A            if(!stack.empty()) %7B%0A                TreeNode tmp = stack.pop();%0A                res.add(tmp.val);%0A                currNode = tmp.right;%0A            %7D%0A        %7D%0A        return res;%0A    %7D%0A%7D%0A

Create 94_Binary_Tree_Inorder_Traversal.java