Add js solution to leetcode no.94

Author: lo0b0o

solution/0000-0099/0094.Binary Tree Inorder Traversal/README.md

@@ -204,6 +204,43 @@ class Solution {
     }
 }
 ```
+### **JavaScript**
+
+递归：
+
+```js
+var inorderTraversal = function(root) {
+    let res = [];
+    function inorder(root){
+        if(root){
+        inorder(root.left);
+        res.push(root.val);
+        inorder(root.right);
+        }
+    }
+    inorder(root);
+    return res;
+};
+```
+非递归：
+
+```js
+var inorderTraversal = function (root) {
+    let res = [], stk = [];
+    let cur = root;
+    while (cur || stk.length !== 0) {
+        while (cur) {
+            stk.push(cur);
+            cur = cur.left;
+        } 
+        let top = stk.pop();
+        res.push(top.val);
+        cur = top.right;
+
+    }
+    return res;
+};
+```
 
 ### **...**
 

solution/0000-0099/0094.Binary Tree Inorder Traversal/README_EN.md

@@ -189,6 +189,44 @@ class Solution {
     }
 }
 ```
+### **JavaScript**
+
+Recursive:
+
+```js
+var inorderTraversal = function(root) {
+    let res = [];
+    function inorder(root){
+        if(root){
+        inorder(root.left);
+        res.push(root.val);
+        inorder(root.right);
+        }
+    }
+    inorder(root);
+    return res;
+};
+```
+Non-recursive:
+
+```js
+var inorderTraversal = function (root) {
+    let res = [], stk = [];
+    let cur = root;
+    while (cur || stk.length !== 0) {
+        while (cur) {
+            stk.push(cur);
+            cur = cur.left;
+        } 
+        let top = stk.pop();
+        res.push(top.val);
+        cur = top.right;
+
+    }
+    return res;
+};
+```
+
 
 ### **...**
 

solution/0000-0099/0094.Binary Tree Inorder Traversal/Solution.js

@@ -0,0 +1,30 @@
+//non-recursive
+var inorderTraversal = function (root) {
+    let res = [], stk = [];
+    let cur = root;
+    while (cur || stk.length !== 0) {
+        while (cur) {
+            stk.push(cur);
+            cur = cur.left;
+        } 
+        let top = stk.pop();
+        res.push(top.val);
+        cur = top.right;
+
+    }
+    return res;
+};
+
+//recursive
+var inorderTraversal = function(root) {
+    let res = [];
+    function inorder(root){
+        if(root){
+        inorder(root.left);
+        res.push(root.val);
+        inorder(root.right);
+        }
+    }
+    inorder(root);
+    return res;
+};