LeetCode in Python 107. 二叉树的层序遍历

1、题目

https://leetcode.cn/problems/binary-tree-level-order-traversal-ii/

输入：二叉树的根节点

输出：其节点值自底向上的层序遍历

2、思考

虽然结果是需要从叶子节点向上输出，但是其实可以从“3”开始，一层一层向下，先左后右的输出，最后将结果反向输出即可。

3、解题

# 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]]:
        if root is None:
            return []

        result,current = [], [root]

        while current:
            next_level , nodes =[], []
            for node in current:
                nodes.append(node.val)
                if node.left:
                    next_level.append(node.left)
                if node.right:
                    next_level.append(node.right)
            current = next_level
            result.append(nodes)

        return result[::-1]

一顿操作猛如虎，一看结果57%。