-
-
Notifications
You must be signed in to change notification settings - Fork 299
/
199.py
54 lines (52 loc) · 1.77 KB
/
199.py
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
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
__________________________________________________________________________________________________
sample 20 ms submission
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
import collections
class Solution:
def rightSideView(self, root: TreeNode) -> List[int]:
res = []
if not root:
return res
dq = collections.deque([root])
while dq:
for _ in range(len(dq)):
node = dq.popleft()
if node.left:
dq.append(node.left)
if node.right:
dq.append(node.right)
res.append(node.val)
return res
__________________________________________________________________________________________________
sample 13012 kb submission
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
import collections
class Solution:
def rightSideView(self, root: TreeNode) -> List[int]:
# BFS and get the last element for each depth
if not root:
return []
bfs_order = collections.deque([root])
res = []
while bfs_order:
new_order = collections.deque([])
while bfs_order:
node = bfs_order.popleft()
if node.left:
new_order.append(node.left)
if node.right:
new_order.append(node.right)
res.append(node.val)
bfs_order = new_order
return res
__________________________________________________________________________________________________