Commit f14ae04

author

Joseph Luce

authored

Update 094_binary_tree_inorder_traversal.md

1 parent 57420fc commit f14ae04Copy full SHA for f14ae04

File tree

-8

lines changed

-8

lines changed

Lines changed: 6 additions & 8 deletions

Original file line number	Diff line number	Diff line change
`@@ -47,15 +47,13 @@ class Solution:`
`47`	`47`	`def inorderTraversal(self, root: TreeNode) -> List[int]:`
`48`	`48`	`stack, result = list(), list()`
`49`	`49`	`curr_node = root`
`50`		`- while True:`
`51`		`- if curr_node is not None: # Going down the tree`
	`50`	`+ while stack or curr_node:`
	`51`	`+ if curr_node:`
`52`	`52`	`stack.append(curr_node)`
`53`		`- curr_node = curr_node.left`
`54`		`- elif len(stack) > 0: # Going up the tree (backtracking)`
`55`		`- curr_node = stack.pop()`
`56`		`- result.append(curr_node.val)`
`57`		`- curr_node = curr_node.right`
	`53`	`+ curr_node = curr_node.left # go left`
`58`	`54`	`else:`
`59`		`- break`
	`55`	`+ curr_node = stack.pop() # go up`
	`56`	`+ result.append(curr_node.val)`
	`57`	`+ curr_node = curr_node.right # go right`
`60`	`58`	`return result`
`61`	`59`	```

Comments

(0)