Binary Tree Inorder Traversal

Author: tanjiasheng

Binary Tree Inorder Traversal/index.js

@@ -0,0 +1,31 @@
+/**
+ * Definition for a binary tree node.
+ * function TreeNode(val) {
+ *     this.val = val;
+ *     this.left = this.right = null;
+ * }
+ */
+/**
+ * @param {TreeNode} root
+ * @return {number[]}
+ */
+function inorderTraversal(root) {
+    const result = [];
+    
+    return traversal(root, result);
+};
+
+function traversal(node, result) {
+    if (!node) return result;
+    if (node.left) {
+        traversal(node.left, result)
+    }
+
+    result.push(node.val)
+
+    if (node.right) {
+        traversal(node.right, result)
+    }
+
+    return result;
+}

Binary Tree Inorder Traversal/readme.md

@@ -0,0 +1 @@
+二叉树中序遍历递归解法