leecode107. Binary Tree Level Order Traversal II二叉树层次遍历 自底向上

leecode107. Binary Tree Level Order Traversal II二叉树层次遍历 自底向上
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:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution:
    def levelOrderBottom(self, root: TreeNode) -> List[List[int]]:
        ans,level=[],[root]
        
        while root and level:
            ans.append([node.val for node in level if node])
            lrp=[(node.left,node.right) for node in level if node]
            level=[leaf for lr in lrp for leaf in lr if leaf]
        return ans[::-1]