leetcode-107.二叉树的层次遍历

题目：https://leetcode-cn.com/problems/binary-tree-level-order-traversal-ii/

答案：递归二叉树

  List<List<Integer>> lists;

    public List<List<Integer>> levelOrderBottom(TreeNode root) {

        lists = new ArrayList<>();

        level(root, 0);

        List<List<Integer>> results = new ArrayList<>();

        for(int i=0;i<lists.size();i++){

            results.add(0,lists.get(i));

        }

        return results;

    }

    public void level(TreeNode root, int n){

        if(root!=null){

            if(n<lists.size()){

                lists.get(n).add(root.val);

            }else{

                List<Integer> list = new ArrayList<>();

                list.add(root.val);

                lists.add(list);

            }

            level(root.left,n+1);

            level(root.right,n+1);

        }

    }