leetcode solution

didi0613 · didi0613 · commit 5e57f3afd1c7 · 2016-09-02T08:07:56.000-07:00
diff --git a/binary-tree-inorder-traversal.js b/binary-tree-inorder-traversal.js
@@ -42,25 +42,25 @@ function inorderTraversalBuilder(root, ret) {
  * @param {TreeNode} root
  * @return {number[]}
  */
+/*
+ 1) Create an empty stack S.
+ 2) Initialize current node as root
+ 3) Push the current node to S and set current = current->left until current is NULL
+ 4) If current is NULL and stack is not empty then
+ a) Pop the top item from stack.
+ b) Print the popped item, set current = popped_item->right
+ c) Go to step 3.
+ 5) If current is NULL and stack is empty then we are done.
+ */
 var inorderTraversal = function (root) {
     if (root === null) {
         return [];
     }
-    /*
-     1) Create an empty stack S.
-     2) Initialize current node as root
-     3) Push the current node to S and set current = current->left until current is NULL
-     4) If current is NULL and stack is not empty then 
-     a) Pop the top item from stack.
-     b) Print the popped item, set current = popped_item->right 
-     c) Go to step 3.
-     5) If current is NULL and stack is empty then we are done.
-     */
+
     var ret = [];
     var stack = [root];
     var cur = root;
 
-    stack.push(cur);
     while (stack.length > 0) {
         if (cur && cur.left) {
             cur = cur.left;
