@@ -0,0 +1,760 @@
+/**%0A * Definition for binary tree%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 %3C%3E ();%0A        List %3CInteger%3E ret = new ArrayList %3C%3E ();%0A        %0A        while(root != null) %7B%0A            stack.push(root);%0A            root = root.left;%0A        %7D%0A        %0A        while(!stack.isEmpty()) %7B%0A            TreeNode cur = stack.pop();%0A            ret.add(cur.val);%0A            cur = cur.right;%0A            while(cur != null) %7B%0A                stack.push(cur);%0A                cur = cur.left;%0A            %7D%0A        %7D%0A        %0A        return ret;%0A    %7D%0A%7D%0A

Create Binary_tree_inorder_traversal.java