107. 二叉树的层次遍历 II

其实就是把每层保存的顺序变化一下。

# 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]]:
        if root == None:
            return []
        quece = [root]
        res =  []
        while quece:
            res_cur = []
            length = len(quece)
            for i in range(length):
                node = quece.pop(0)
                res_cur.append(node.val)
                if node.left:
                    quece.append(node.left)
                if node.right:
                    quece.append(node.right)
            # 下面的层放在前面
            res.insert(0,res_cur)
        return res