LeetCode-Binary Tree Level Order Traversal II

最新推荐文章于 2019-05-12 19:09:04 发布

dancheren

最新推荐文章于 2019-05-12 19:09:04 发布

阅读量221

点赞数

分类专栏： LeetCode 文章标签： LeetCode java 遍历 tree

本文链接：https://blog.csdn.net/dancheren/article/details/53376608

版权

LeetCode 专栏收录该内容

44 篇文章 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]
]

Subscribe to see which companies asked this question

此题跟 Binary Tree Level Order Traversal 点击打开链接思路一致，

只是在存储每一行所有结点时保存在链表的 0 号位置，返回时即从二叉树最下面一层开始。代码如下：

/**
 * 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) {
        ArrayList<List<Integer>> al = new ArrayList<List<Integer>>();
        if(root == null) return al;
        ArrayList<Integer> nodeValues = new ArrayList<Integer>();
        LinkedList<TreeNode> current = new LinkedList<TreeNode>();
        LinkedList<TreeNode> next = new LinkedList<TreeNode>();
        current.add(root);
        while(!current.isEmpty()){
            TreeNode node = current.remove();
            if(node.left != null)
            next.add(node.left);
            if(node.right != null)
            next.add(node.right);
            nodeValues.add(node.val);
            if(current.isEmpty()){
                current = next;
                next = new LinkedList<TreeNode>();
                al.add(0,nodeValues);//每遍历一行保存在列表第 0 号位置，返回时从二叉树的最下面一行开始
                nodeValues = new ArrayList<Integer>();
            }
        }
        return al;
        
    }
}