Commit d5cb9f3

authored

Merge pull request #1 from lionXiao/master

fixed an incorrect copy-and-paste

2 parents 88f50a4 + 981a113 commit d5cb9f3Copy full SHA for d5cb9f3

File tree

-13

lines changed

-13

lines changed

Lines changed: 7 additions & 13 deletions

Original file line number	Diff line number	Diff line change
`@@ -71,24 +71,18 @@ class Solution:`
`71`	`71`
`72`	`72`	```Python
`73`	`73`	`class Solution:`
`74`		`- def postorderTraversal(self, root: TreeNode) -> List[int]:`
`75`		`-`
`76`		`- s, postorder = [], []`
`77`		`- node, last_visit = root, None`
`78`		`-`
	`74`	`+ def inorderTraversal(self, root: TreeNode) -> List[int]:`
	`75`	`+ s, inorder = [], []`
	`76`	`+ node = root`
`79`	`77`	`while len(s) > 0 or node is not None:`
`80`	`78`	`if node is not None:`
`81`	`79`	`s.append(node)`
`82`	`80`	`node = node.left`
`83`	`81`	`else:`
`84`		`- peek = s[-1]`
`85`		`- if peek.right is not None and last_visit != peek.right:`
`86`		`- node = peek.right`
`87`		`- else:`
`88`		`- last_visit = s.pop()`
`89`		`- postorder.append(last_visit.val)`
`90`		`-`
`91`		`- return postorder`
	`82`	`+ node = s.pop()`
	`83`	`+ inorder.append(node.val)`
	`84`	`+ node = node.right`
	`85`	`+ return inorder`
`92`	`86`	```
`93`	`87`
`94`	`88`	`#### [后序非递归](https://leetcode-cn.com/problems/binary-tree-postorder-traversal/)`

Comments

(0)