107 Binary Tree Level Order Traversal II

hareyukai

于 2018-04-20 20:21:22 发布

阅读量143

点赞数 1

CC 4.0 BY-SA版权

分类专栏： LeetCode Java

本文链接：https://blog.youkuaiyun.com/guothin/article/details/80023581

LeetCode 同时被 2 个专栏收录

13 篇文章

订阅专栏

Java

12 篇文章

订阅专栏

本文介绍了一种从叶节点到根节点的层次遍历二叉树的方法，并提供了一个具体的例子来展示如何实现这一遍历过程。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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],

return its bottom-up level order traversal as:

[
  [15,7],
  [9,20],
  [3]
]

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
  public List<List<Integer>> levelOrderBottom(TreeNode root) {
    List<List<Integer>> list = new LinkedList<List<Integer>>();
    Queue<TreeNode> queue = new LinkedList<TreeNode>();
    if(root == null) { return list; }
    queue.offer(root);
    while(!queue.isEmpty()){
      int num = queue.size();
      List<Integer> levelList = new LinkedList<Integer>();
      for(int i = 0; i < num; i++){
        if(queue.peek().left != null)
          queue.offer(queue.peek().left);
        if(queue.peek().right != null)
          queue.offer(queue.peek().right);
        levelList.add(queue.poll().val);
      }
      list.add(0, levelList);
    }
    return list;
  }
}