107. Binary Tree Level Order Traversal II

最新推荐文章于 2021-08-10 13:02:56 发布

SnailRunFast

最新推荐文章于 2021-08-10 13:02:56 发布

阅读量190

点赞数

CC 4.0 BY-SA版权

分类专栏： Leet Code 文章标签： Binary Tree Level Or

本文链接：https://blog.youkuaiyun.com/snailrunfast/article/details/69938625

Leet Code 专栏收录该内容

143 篇文章

订阅专栏

本文介绍了一种从叶节点到根节点的层次遍历二叉树的方法，并提供了详细的Java实现代码。通过队列记录节点并迭代元素，最终返回一个列表集合。

摘要生成于 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]
]

Subscribe to see which companies asked this question.

Solution:

Tips:

leverage queue to record the node, and iterate the elements.

Java Code:

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public List<List<Integer>> levelOrderBottom(TreeNode root) {
        LinkedList<List<Integer>> result = new LinkedList<>();
        if (null == root) {
            return result;
        }
        
        Queue<TreeNode> queue = new LinkedList<TreeNode>();
        queue.add(root);
        int levelCnt = 1;
        
        while (!queue.isEmpty()) {
            int cnt = 0;
            List<Integer> llt = new ArrayList<>();
            for (int i = 0; i < levelCnt; i++) {
                TreeNode node = queue.poll();
                llt.add(node.val);
                if (node.left != null) {
                    queue.add(node.left);
                    cnt++;
                }
                if (node.right != null) {
                    queue.add(node.right);
                    cnt++;
                }
            }
            levelCnt = cnt;
            result.addFirst(llt);
        }
        
        return result;
    }
}