題目：
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]
]

翻譯：
給定一個(gè)二叉樹，返回它的節(jié)點(diǎn)的從底部到頭部的層序遍歷結(jié)果。

代碼：

/*** 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>> result=levelOrder(root);Collections.reverse(result);return result;}public List<List<Integer>> levelOrder(TreeNode root) {List<List<Integer>> result=new ArrayList<>();if(root==null){return result;}List<Integer> one=new ArrayList<>();one.add(root.val);result.add(one);List<List<Integer>> left=levelOrder(root.left);List<List<Integer>> right=levelOrder(root.right);for(int i=0;i<left.size()||i<right.size();i++){List<Integer> item=new ArrayList<>();if(i<left.size()){for(Integer k:left.get(i)){item.add(k);}}if(i<right.size()){for(Integer k:right.get(i)){item.add(k);}}result.add(item);}return result;} }

總結(jié)

以上是生活随笔為你收集整理的Leet Code OJ 107. Binary Tree Level Order Traversal II [Difficulty: Easy]的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。