leetcode 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,null,null,15,7],

    3
   / \
  9  20
    /  \
   15   7

 

return its bottom-up level order traversal as:

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

中文理解：层次遍历二叉树，并将每一层的节点保存在一个动态数组里面，所有层的遍历结果组成一个大动态数组，同时二叉树层数越低则在最终的结果中顺序越靠后。

解题思路：使用递归的方法，每一层有一个变量level从0开始记录层数，一次递归保存结果，最后将结果反转得到最终的结果。

代码（java）:

/**
 * 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 = new ArrayList<>();
        travelTree(0, root, result);
        List<List<Integer>> reverseRst = new ArrayList<>();
        for (int i = 0; i < result.size(); i++) {
            reverseRst.add(result.get(result.size() - i - 1));
        }
        return reverseRst;
    }

    private void travelTree(int level, TreeNode root, List<List<Integer>> result) {
        if (root == null) return;
        if (result.size() <= level) result.add(new ArrayList<>());
        result.get(level).add(root.val);
        travelTree(level + 1, root.left, result);
        travelTree(level + 1, root.right, result);
    }
}