Update binary-tree-postorder-traversal.cpp

Author: kamyu104

C++/binary-tree-postorder-traversal.cpp

@@ -61,8 +61,8 @@ class Solution2 {
         vector<int> res;
         stack<pair<TreeNode *, bool>> s;
         s.emplace(root, false);
-        bool visited;
         while (!s.empty()) {
+            bool visited;
             tie(root, visited) = s.top();
             s.pop();
             if (root == nullptr) {