Update binary-tree-right-side-view.py

Last node in list is always the right most view.
XuhuiRen · Sep 15, 2018 · 48b995a · 48b995a
1 parent 5810b7e
commit 48b995a
Showing 1 changed file with 3 additions and 4 deletions.
diff --git a/Python/binary-tree-right-side-view.py b/Python/binary-tree-right-side-view.py
@@ -55,13 +55,12 @@ def rightSideView(self, root):
         result, current = [], [root]
         while current:
             next_level = []
-            for i, node in enumerate(current):
+            for node in current:
                 if node.left:
                     next_level.append(node.left)
                 if node.right:
-                    next_level.append(node.right)
-                if i == len(current) - 1:
-                    result.append(node.val)
+                    next_level.append(node.right)                
+            result.append(node.val)
             current = next_level
 
         return result