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,null,null,15,7],
3
/ \
9 20
/ \
15 7
return its bottom-up level order traversal as:
[
[15,7],
[9,20],
[3]
]

解题思路

和LeetCode-102,LeetCode-103类似，本题，本题要求从树的高度最大处到最小处逐层遍历，每层按照从左到右的顺序遍历，提供了递归和遍历两种解题的方式。

代码

递归的方式

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    LinkedList<List<Integer>> result = new LinkedList<List<Integer>>();
    public List<List<Integer>> levelOrderBottom(TreeNode root) {

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

遍历的方式

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    LinkedList<List<Integer>> result = new LinkedList<List<Integer>>();
    public List<List<Integer>> levelOrderBottom(TreeNode root) {

        if(root == null)
            return result;
        core(root,1);
        Queue<TreeNode> stack = new LinkedList<TreeNode>();
        stack.add(root);
        while(stack.size() != 0){
            int size = stack.size();
            List<Integer> tmp = new LinkedList<Integer>();
            for(int i=0;i<size;i++){
                TreeNode cur = stack.poll();
                tmp.add(cur.val);
                if(cur.left!=null)
                    stack.add(cur.left);
                if(cur.right!=null)
                    stack.add(cur.right);
            }
            result.addFirst(tmp);
        }
        return result;
    }
}