Difficulty
Easy.
Problem
Given a binary tree, return the bottom-up level order traversal of its nodes' values.
(ie, from left to right, level by level from leaf to root).
For example:
Given binary tree [3,9,20,null,null,15,7],
3
/ \
9 20
/ \
15 7
return its bottom-up level order traversal as:
[
[15,7],
[9,20],
[3]
]
AC
# Definition for a binary tree node.
# class TreeNode(object):
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
# BFS
class Solution():
def levelOrderBottom(self, root):
res = []
if root:
level = [root]
while len(level):
res = [[node.val for node in level]] + res
tmp = []
for node in level:
if node.left:
tmp.append(node.left)
if node.right:
tmp.append(node.right)
level = tmp
return res