104. Maximum Depth of Binary Tree (변수명 수정)

Author: okyungjin

maximum-depth-of-binary-tree/okyungjin.py

@@ -13,16 +13,16 @@ def maxDepth(self, root: Optional[TreeNode]) -> int:
             return 0
 
         max_depth = 1
-        queue = [(root, 1)]
+        stack = [(root, 1)]
 
-        while queue:
-            node, cur_depth = queue.pop()
+        while stack:
+            node, cur_depth = stack.pop()
             max_depth = max(cur_depth, max_depth)
 
             if node.left:
-                queue.append((node.left, cur_depth + 1))
+                stack.append((node.left, cur_depth + 1))
 
             if node.right:
-                queue.append((node.right, cur_depth + 1))
+                stack.append((node.right, cur_depth + 1))
 
         return max_depth