add solution of problem 94: binary tree inorder traversal

Author: ppulse

BinaryTreeInorderTraversal94/README.md

@@ -0,0 +1,17 @@
+Given a binary tree, return the inorder traversal of its nodes' values.
+
+For example:
+Given binary tree `[1,null,2,3]`,
+```
+
+   1
+    \
+     2
+    /
+   3
+
+```
+
+return `[1,3,2]`.
+
+**Note:** Recursive solution is trivial, could you do it iteratively?

BinaryTreeInorderTraversal94/Solution.java

@@ -0,0 +1,25 @@
+/**
+ * Definition for a binary tree node.
+ * public class TreeNode {
+ *     int val;
+ *     TreeNode left;
+ *     TreeNode right;
+ *     TreeNode(int x) { val = x; }
+ * }
+ */
+public class Solution {
+    public List<Integer> inorderTraversal(TreeNode root) {
+        List<Integer> result = new ArrayList<Integer>();
+
+        inorder(root, result);
+        return result;
+    }
+    
+    private void inorder(TreeNode node, List<Integer> result) {
+        if (node == null)
+            return;
+        inorder(node.left, result);
+        result.add(node.val);
+        inorder(node.right, result);
+    }
+}