mirror of
https://github.com/halfrost/LeetCode-Go.git
synced 2025-08-03 02:47:26 +08:00
78 lines
1.3 KiB
Markdown
78 lines
1.3 KiB
Markdown
# [107. Binary Tree Level Order Traversal II](https://leetcode.com/problems/binary-tree-level-order-traversal-ii/)
|
|
|
|
## 题目
|
|
|
|
Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to right, level by level from leaf to root).
|
|
|
|
**For Example**:
|
|
|
|
Given binary tree [3,9,20,null,null,15,7],
|
|
|
|
```
|
|
|
|
3
|
|
/ \
|
|
9 20
|
|
/ \
|
|
15 7
|
|
|
|
```
|
|
|
|
return its bottom-up level order traversal as:
|
|
|
|
|
|
```
|
|
|
|
[
|
|
[15,7],
|
|
[9,20],
|
|
[3]
|
|
]
|
|
|
|
```
|
|
|
|
|
|
## 题目大意
|
|
|
|
按层序从下到上遍历一颗树。
|
|
|
|
## 解题思路
|
|
|
|
用一个队列即可实现。
|
|
|
|
|
|
|
|
|
|
|
|
## 代码
|
|
|
|
```go
|
|
|
|
package leetcode
|
|
|
|
/**
|
|
* Definition for a binary tree node.
|
|
* type TreeNode struct {
|
|
* Val int
|
|
* Left *TreeNode
|
|
* Right *TreeNode
|
|
* }
|
|
*/
|
|
func levelOrderBottom(root *TreeNode) [][]int {
|
|
tmp := levelOrder(root)
|
|
res := [][]int{}
|
|
for i := len(tmp) - 1; i >= 0; i-- {
|
|
res = append(res, tmp[i])
|
|
}
|
|
return res
|
|
}
|
|
|
|
```
|
|
|
|
|
|
----------------------------------------------
|
|
<div style="display: flex;justify-content: space-between;align-items: center;">
|
|
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal/">⬅️上一页</a></p>
|
|
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0100~0199/0108.Convert-Sorted-Array-to-Binary-Search-Tree/">下一页➡️</a></p>
|
|
</div>
|