Update iterative-tree-traversal-1.cpp

Author: rachitiitr

iterative-tree-traversal-1.cpp

@@ -13,16 +13,16 @@ struct node{
 unordered_map<node*, int> cnt;
 
 void traversal_trick(node *root) {
-    //postorder
+    //inorder
     stack<node*> S;
 
     S.push(root);
     while(!S.empty()){
         node* cur = S.top();
         if(cur == NULL) { S.pop(); continue; }
         if (cnt[cur] == 0) S.push(cur->left);
-        else if (cnt[cur] == 1) S.push(cur->right);
-        else if (cnt[cur] == 2) cout << cur->val << " " ;
+        else if (cnt[cur] == 1) cout << cur->val << " " ;
+        else if (cnt[cur] == 2) S.push(cur->right);
         else S.pop();
         cnt[cur]++;
     }