> For the complete documentation index, see [llms.txt](https://cai-sen-se.gitbook.io/leetcode/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://cai-sen-se.gitbook.io/leetcode/1-200/107.-er-cha-shu-de-ceng-ci-bian-li-ii.md).

# 107. 二叉树的层次遍历 II

<https://leetcode-cn.com/problems/binary-tree-level-order-traversal-ii/description/>

## 解法一：

层序遍历，然后结果倒序

```python
# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None
import queue
class Solution:
    def levelOrderBottom(self, root: TreeNode) -> List[List[int]]:
        res = []
        if not root:
            return res

        q = queue.Queue()
        q.put(root)
        while not q.empty():
            count = q.qsize()
            data = []
            for _ in range(count):
                node = q.get()
                data.append(node.val)
                if node.left:
                    q.put(node.left)
                if node.right:
                    q.put(node.right)
            res.append(data)
        res = res[::-1]
        return res
```