Merge pull request #2766 from ZaneCodeJourney/026.Python

0226翻转二叉树，删除冗余代码

Author: youngyangyang04

problems/0226.翻转二叉树.md

@@ -459,11 +459,10 @@ class Solution:
 
         queue = collections.deque([root])    
         while queue:
-            for i in range(len(queue)):
-                node = queue.popleft()
-                node.left, node.right = node.right, node.left
-                if node.left: queue.append(node.left)
-                if node.right: queue.append(node.right)
+            node = queue.popleft()
+            node.left, node.right = node.right, node.left
+            if node.left: queue.append(node.left)
+            if node.right: queue.append(node.right)
         return root   
 
 ```
@@ -1033,4 +1032,3 @@ public TreeNode InvertTree(TreeNode root) {
 <a href="https://programmercarl.com/other/kstar.html" target="_blank">
   <img src="../pics/网站星球宣传海报.jpg" width="1000"/>
 </a>
-