Update binary-tree-inorder-traversal.py

kamyu104 · web-flow · commit f76af249346b · 2016-08-02T21:27:20.000+08:00
diff --git a/Python/binary-tree-inorder-traversal.py b/Python/binary-tree-inorder-traversal.py
@@ -30,25 +30,23 @@ def inorderTraversal(self, root):
         :type root: TreeNode
         :rtype: List[int]
         """
-        result, prev, cur = [], None, root
-        while cur:
-            if cur.left is None:
-                result.append(cur.val)
-                prev = cur
-                cur = cur.right
+        result, curr = [], root
+        while curr:
+            if curr.left is None:
+                result.append(curr.val)
+                curr = curr.right
             else:
-                node = cur.left
-                while node.right and node.right != cur:
+                node = curr.left
+                while node.right and node.right != curr:
                     node = node.right
             
                 if node.right is None:
-                    node.right = cur
-                    cur = cur.left
+                    node.right = curr
+                    curr = curr.left
                 else:
-                    result.append(cur.val)
+                    result.append(curr.val)
                     node.right = None
-                    prev = cur
-                    cur = cur.right
+                    curr = curr.right
                 
         return result
 
