从下到上打印二叉树

最新推荐文章于 2024-07-25 19:34:38 发布

蛋卷在月球烤面包

最新推荐文章于 2024-07-25 19:34:38 发布

阅读量164

点赞数

文章标签： leetcode 树层次遍历

本文链接：https://blog.csdn.net/weixin_39248750/article/details/130866210

版权

用栈接住层次遍历每一层的一维数组结果，然后再弹栈形成最终要返回的二维数组结果

import java.util.*;

/*
 * public class TreeNode {
 *   int val = 0;
 *   TreeNode left = null;
 *   TreeNode right = null;
 *   public TreeNode(int val) {
 *     this.val = val;
 *   }
 * }
 */

public class Solution {
    public int[][] levelOrderBottom (TreeNode root) {
        // write code here
        Stack<int[]> stack = new Stack<>();
        Queue<TreeNode> queue = new LinkedList<>();
        queue.offer(root);
        while(!queue.isEmpty()){
            int queueSize = queue.size();
            int[] layer = new int[queueSize];
            for(int i = 0; i < queueSize; i++){
                TreeNode node = queue.poll();
                layer[i] = node.val;
                if(node.left != null){
                    queue.offer(node.left);
                }
                if(node.right != null){
                    queue.offer(node.right);
                }
            }
            stack.push(layer);
        }
        int row = 0;
        int[][] res = new int[stack.size()][];
        while(!stack.isEmpty()){
            res[row] = stack.pop();
            row ++;
        }
        return res;
    }
}

出自牛客网