Skip to content

Commit

Permalink
update
Browse files Browse the repository at this point in the history
  • Loading branch information
kamyu104 committed Nov 1, 2014
1 parent 4aa9bc8 commit 049b199
Showing 1 changed file with 0 additions and 3 deletions.
3 changes: 0 additions & 3 deletions Python/binary-tree-postorder-traversal.py
Original file line number Diff line number Diff line change
Expand Up @@ -32,7 +32,6 @@ def postorderTraversal(self, root):
result, cur = [], dummy
while cur:
if cur.left is None:
prev = cur
cur = cur.right
else:
node = cur.left
Expand All @@ -41,12 +40,10 @@ def postorderTraversal(self, root):

if node.right is None:
node.right = cur
prev = cur
cur = cur.left
else:
result += self.traceBack(cur.left, node)
node.right = None
prev = cur
cur = cur.right

return result
Expand Down

0 comments on commit 049b199

Please sign in to comment.