LeetCode(107) Binary Tree Level Order Traversal II解题报告

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

    3
   / \
  9  20
    /  \
   15   7

return its bottom-up level order traversal as:

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

解题思路:

层次遍历二叉树，除了递归的位置换了下，和Binary Tree Level Order Traversal是一样的。

public class Solution {
    List<List<Integer>> res;
    public List<List<Integer>> levelOrderBottom(TreeNode root) {
        res = new ArrayList<List<Integer>>();
        List<TreeNode> node = new ArrayList<TreeNode>();
        if(root != null && node.add(root))
            levelValue(node);
        return res;
    }
    public void levelValue(List<TreeNode> node){
        TreeNode tn;
        List<Integer> value = new ArrayList<Integer>();
        List<TreeNode> temp = new ArrayList<TreeNode>();
        if(node.size() == 0)
            return ;
        for(int i = 0; i < node.size(); i++){
            tn = node.get(i);
            value.add(tn.val);
            if(tn.left != null && temp.add(tn.left));
            if(tn.right != null && temp.add(tn.right));
        }
        levelValue(temp);
        res.add(value); 
    }
}