给定一个二叉树,返回其节点值自底向上的层次遍历。 (即按从叶子节点所在层到根节点所在的层,逐层从左向右遍历)
例如:
给定二叉树 [3,9,20,null,null,15,7]
,
3 / \ 9 20 / \ 15 7
返回其自底向上的层次遍历为:
[ [15,7], [9,20], [3] ]
思路:
水题,看到就晕了,只需要把102题解的输出倒序一下就OK,在python里只要修改result为result[::-1]即可
102题解参考:LeetCode-102
# Definition for a binary tree node.
# class TreeNode(object):
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution(object):
def levelOrderBottom(self, root):
"""
:type root: TreeNode
:rtype: List[List[int]]
"""
# Definition for a binary tree node.
if not root:
return []
node = [root]
node_val = list(list())
self.generate(node, node_val)
return node_val[::-1]
def generate(self, node, node_val):
new_node = []
new_node_val = []
for node in node:
if node.left:
new_node.append(node.left)
if node.right:
new_node.append(node.right)
new_node_val.append(node.val)
node_val.append(new_node_val)
if len(new_node) == 0:
return
self.generate(new_node, node_val)