描述
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)
一个二叉树,返回其节点值自底向上的层次遍历。 (即按从叶子节点所在层到根节点所在的层,逐层从左向右遍历)
例子
思路
BFS: 把每一层的节点都放在队列中,把每一层结点的逐个取出,得到值的List,并填充下一层的非空结点,最后将该层值的list插入到总list的0下标
答案
- python
from queue import Queue
class Solution:
def levelOrderBottom(self, root: TreeNode) -> List[List[int]]:
if not root:
return []
q = Queue()
q.put(root)
arr = []
while not q.empty():
L = q.qsize()
t_arr = []
for i in range(L):
temp = q.get()
t_arr.append(temp.val)
if temp.left:
q.put(temp.left)
if temp.right:
q.put(temp.right)
arr.insert(0,t_arr)
return arr
- java
import java.util.Queue;
import java.util.LinkedList;
class Solution {
public List<List<Integer>> levelOrderBottom(TreeNode root) {
List<List<Integer>> LL = new LinkedList<List<Integer>>();
if (root==null)
return LL;
Queue<TreeNode> q = new LinkedList<TreeNode>();
q.offer(root);
while (!q.isEmpty())
{
List<Integer> t_LL = new LinkedList<Integer>();
int L = q.size();
for (int i=0; i<L; i++)
{
TreeNode t = q.poll();
t_LL.add(t.val);
if (t.left != null)
q.offer(t.left);
if (t.right != null)
q.offer(t.right);
}
LL.add(0, t_LL); //插入首位
}
return LL;
}
}