-
Notifications
You must be signed in to change notification settings - Fork 302
Expand file tree
/
Copy path107.py
More file actions
31 lines (23 loc) · 689 Bytes
/
Copy path107.py
File metadata and controls
31 lines (23 loc) · 689 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
#!/usr/bin/python
# -*- coding: utf-8 -*-
# Author: Yu Zhou
# 107. Binary Tree Level Order Traversal II
# 思路：
# 视频参见102，直接把107的res，reverse即可
class Solution(object):
def levelOrderBottom(self, root):
"""
:type root: TreeNode
:rtype: List[List[int]]
"""
self.res = []
def dfs(root, level):
if not root:
return
if len(self.res) == level:
self.res.append([])
self.res[level].append(root.val)
left = dfs(root.left, level + 1)
right = dfs(root.right, level + 1)
dfs(root, 0)
return self.res[::-1]