Create 94.二叉树的中序遍历.js

Author: yinxin630

94.二叉树的中序遍历.js

@@ -0,0 +1,26 @@
+/**
+ * Definition for a binary tree node.
+ * function TreeNode(val) {
+ *     this.val = val;
+ *     this.left = this.right = null;
+ * }
+ */
+/**
+ * @param {TreeNode} root
+ * @return {number[]}
+ */
+var inorderTraversal = function(root) {
+    const result = [];
+    const stack = [];
+    let cur = root;
+    while (cur !== null || stack.length !== 0) {
+        while (cur !== null) {
+            stack.push(cur);
+            cur = cur.left;
+        }
+        cur = stack.pop();
+        result.push(cur.val);
+        cur = cur.right;
+    }
+    return result;
+};