Time: 101 ms (28.09%), Space: 42.2 MB (55.16%) - LeetHub

Author: Inventor77

94-binary-tree-inorder-traversal/94-binary-tree-inorder-traversal.js

@@ -0,0 +1,26 @@
+/**
+ * Definition for a binary tree node.
+ * function TreeNode(val, left, right) {
+ *     this.val = (val===undefined ? 0 : val)
+ *     this.left = (left===undefined ? null : left)
+ *     this.right = (right===undefined ? null : right)
+ * }
+ */
+/**
+ * @param {TreeNode} root
+ * @return {number[]}
+ */
+
+
+const inorder = (root, ans ) => {
+    if(root === null) return;
+    inorder(root.left, ans);
+    ans.push(root.val);
+    inorder(root.right, ans);
+}
+
+var inorderTraversal = function(root) {
+    const ans = [];
+    inorder(root, ans);
+    return ans;
+};