Binary Tree Level Order Traversal II

最新推荐文章于 2019-06-27 15:08:13 发布

风陵渡口

最新推荐文章于 2019-06-27 15:08:13 发布

阅读量352

点赞数

分类专栏： leetcode 文章标签： leetcode 算法

本文链接：https://blog.csdn.net/u010993983/article/details/39755141

版权

leetcode 专栏收录该内容

86 篇文章 0 订阅

订阅专栏

Problem:

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,#,#,15,7},

return its bottom-up level order traversal as:

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

Solution:

/**
* Definition for binary tree
* 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>> result = new LinkedList<>();

ArrayList<TreeNode> queue = new ArrayList<>();

if(root==null)
       return result;

queue.add(root);

while(!queue.isEmpty())
{
       int cnt = queue.size();
       ArrayList<Integer> list = new ArrayList<>();
       while(cnt-->0)
       {
           TreeNode t = queue.remove(0);
           list.add(t.val);
           if(t.left!=null)
               queue.add(queue.size(), t.left);
           if(t.right!=null)
               queue.add(queue.size(),t.right);
   }
   result.add(0,list);
}

return result;
}
}