-
Notifications
You must be signed in to change notification settings - Fork 2
/
q0102.py
36 lines (28 loc) · 1001 Bytes
/
q0102.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
#!/usr/bin/python3
from typing import List
# Definition for a binary tree node.
class TreeNode:
def __init__(self, val=0, left=None, right=None):
self.val = val
self.left = left
self.right = right
class Solution:
def levelOrderBottom_helper(self, root: TreeNode, length: int, result: List[List[int]]):
if root:
if length > len(result):
result.append(list())
result[length - 1].append(root.val)
self.levelOrderBottom_helper(root.left, length + 1, result)
self.levelOrderBottom_helper(root.right, length + 1, result)
def levelOrder(self, root: TreeNode) -> List[List[int]]:
result: List[List[int]] = list()
self.levelOrderBottom_helper(root, 1, result)
return result
node15 = TreeNode(15)
node7 = TreeNode(7)
node20 = TreeNode(20,node15, node7)
node9 = TreeNode(9)
node3 = TreeNode(3, node9, node20)
solu = Solution()
result = solu.levelOrder(node3)
print(result)