题目链接:https://leetcode.com/problems/binary-tree-level-order-traversal-ii
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] ]
# 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]]
"""
res=[]
self.des(root,0,res)
return res
def des(self,root,depth,res):
if root:
if depth>=len(res):
res.insert(0,[])
res[-(depth+1)].append(root.val)
self.des(root.left,depth+1,res)
self.des(root.right,depth+1,res)