Time: 45 ms (89.06%), Space: 49.2 MB (19.89%) - LeetHub

Author: hogan-tech

0094-binary-tree-inorder-traversal/0094-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[]}
+ */
+
+var inorderTraversal = function(root) {
+    const result = [];
+    function inorder(node) {
+        if (node) {
+            inorder(node.left);
+            result.push(node.val);
+            inorder(node.right);
+        }
+    }
+    inorder(root);
+    return result;
+};