107-binary-tree-level-order-traversal-ii

Given the root of a binary tree, return the bottom-up level order traversal of its nodes’ values. (i.e., from left to right, level by level from leaf to root).

Example 1:

Input: root = [3,9,20,null,null,15,7] Output: [[15,7],[9,20],[3]] Example 2:

Input: root = [1] Output: [[1]] Example 3:

Input: root = [] Output: []

My solution：

# Definition for a binary tree node.
# class TreeNode(object):
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution(object):
    def levelOrderBottom(self, root):
        """
        :type root: Optional[TreeNode]
        :rtype: List[List[int]]
        """
        if not root:
            return []
        quene = [root]
        res = []
        while quene:
            tmp = []
            val = []
            while quene:
                cur = quene.pop(0)
                val.append(cur.val)
                if cur.left:
                    tmp.append(cur.left)
                if cur.right:
                    tmp.append(cur.right)
            quene = tmp[:]
            res.append(val)
        return res[::-1]