【leetcode】107. Binary Tree Level Order Traversal II

最新推荐文章于 2023-11-07 00:14:20 发布

nova0831

最新推荐文章于 2023-11-07 00:14:20 发布

阅读量223

点赞数

分类专栏： leetcode 文章标签： leetcode 二叉树

本文链接：https://blog.csdn.net/nova0831/article/details/53021911

版权

leetcode 专栏收录该内容

36 篇文章 0 订阅

订阅专栏

题目要求：

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; }
 * }
 */
public class Solution {
    public List<List<Integer>> levelOrderBottom(TreeNode root) {
        

        List<List<Integer>> wholeList = new LinkedList<List<Integer>>();
         if(root==null)
        {
            return wholeList;
        }
        Queue<TreeNode> queue = new LinkedList<TreeNode>();
        queue.offer(root);
        while(!queue.isEmpty())
        {
            List<Integer> list = new LinkedList<Integer>();
            int size = queue.size();
            for(int i=0;i<size;i++)
            {
                TreeNode temp = queue.peek();
                queue.poll();
                list.add(temp.val);
                if(temp.left!=null)
                {
                    queue.offer(temp.left);
                }
                if(temp.right!=null)
                {
                    queue.offer(temp.right);
                }
            }
            wholeList.add(list);
        }


      Collections.reverse(wholeList);

        return wholeList;
    }
}