Sitrone
diff --git a/‎…Inorder Traversal/AC_Iterable_stack.java‎ ‎…norder Traversal/AC_Iteration_stack.java‎solutions/94. Binary Tree Inorder Traversal/AC_Iterable_stack.java renamed to solutions/94. Binary Tree Inorder Traversal/AC_Iteration_stack.java b/‎…Inorder Traversal/AC_Iterable_stack.java‎ ‎…norder Traversal/AC_Iteration_stack.java‎solutions/94. Binary Tree Inorder Traversal/AC_Iterable_stack.java renamed to solutions/94. Binary Tree Inorder Traversal/AC_Iteration_stack.java
diff --git a/‎solutions/94. Binary Tree Inorder Traversal/AC_recursion.java‎
Lines changed: 26 additions & 0 deletions b/‎solutions/94. Binary Tree Inorder Traversal/AC_recursion.java‎
Lines changed: 26 additions & 0 deletions
@@ -0,0 +1,26 @@
+/**
+ * Definition for a binary tree node.
+ * public class TreeNode {
+ *     int val;
+ *     TreeNode left;
+ *     TreeNode right;
+ *     TreeNode(int x) { val = x; }
+ * }
+ */
+public class Solution {
+    private List<Integer> res = new ArrayList<Integer>();
+    public List<Integer> inorderTraversal(TreeNode root) {
+        if(root != null){
+            helper(root);
+        }
+        return res;
+    }
+    
+    private void helper(TreeNode root) {
+        if (root != null) {
+            helper(root.left);
+            res.add(root.val);
+            helper(root.right);        
+        }
+    }
+}