107层序遍历

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right class Solution:
    def levelOrderBottom(self, root: TreeNode) -> List[List[int]]:
        results = []
        if not root:
            return results
        q = collections.deque([root])##构造一个先进先出队列
        while q:
            lenth = len(q)
            result = []#保持一致
            for _ in range(lenth):
                cur = q.popleft()##队列移除元素，并返回该元素的值
                result.append(cur.val)
                if cur.left:
                    q.append(cur.left)
                if cur.right:
                    q.append(cur.right)
            results.append(result)#保持一致
        return results[::-1]##序列反转