Commit 819be30

committed

🐱(tree): 107. 二叉树的层序遍历 II

1 parent 37cc227 commit 819be30Copy full SHA for 819be30

File tree

+35

-0

lines changed

+35

-0

lines changed

Lines changed: 35 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -80,6 +80,41 @@ func levelOrder(root *TreeNode) [][]int {`
`80`	`80`	`}`
`81`	`81`	```
`82`	`82`
	`83`	`+## 107. 二叉树的层序遍历 II`
	`84`	`+`
	`85`	`+[原题链接](https://leetcode-cn.com/problems/binary-tree-level-order-traversal-ii/)`
	`86`	`+`
	`87`	`+与 106 类似,只是结果输出顺序不同。`
	`88`	`+`
	`89`	+```python
	`90`	`+# Definition for a binary tree node.`
	`91`	`+# class TreeNode:`
	`92`	`+# def __init__(self, x):`
	`93`	`+# self.val = x`
	`94`	`+# self.left = None`
	`95`	`+# self.right = None`
	`96`	`+`
	`97`	`+class Solution:`
	`98`	`+ def levelOrderBottom(self, root: TreeNode) -> List[List[int]]:`
	`99`	`+ ans = []`
	`100`	`+ q = [root]`
	`101`	`+ while len(q) != 0:`
	`102`	`+ # 遍历一层`
	`103`	`+ tmp = []`
	`104`	`+ for i in range(len(q)):`
	`105`	`+ top = q[0]`
	`106`	`+ del q[0]`
	`107`	`+ if top is None:`
	`108`	`+ continue`
	`109`	`+ tmp.append(top.val)`
	`110`	`+ q.append(top.left)`
	`111`	`+ q.append(top.right)`
	`112`	`+ if len(tmp) != 0:`
	`113`	`+ ans.append(tmp)`
	`114`	`+`
	`115`	`+ return ans[::-1]`
	`116`	+```
	`117`	`+`
`83`	`118`	`<!-- tabs:end -->`
`84`	`119`
`85`	`120`	`## 108. 将有序数组转换为二叉搜索树`

Comments

(0)