leetcode刷题_OJ 102

Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).

For example:
Given binary tree [3,9,20,null,null,15,7],
    3
   / \
  9  20
    /  \
   15   7
return its level order traversal as:
[
  [3],
  [9,20],
  [15,7]
]
二叉树的层次遍历，不同的地方是每一层的值要用一个列表存储，最终输出的是一个二维列表。

近来做回溯做得很多，这题也大概按了这样的模板来实现

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public List<List<Integer>> levelOrder(TreeNode root) {
        List<List<Integer>> result=new ArrayList<>();
        List<Integer> subtree=new ArrayList<>();
        backTrack(result,0,root);
        return result;
    }

    private void backTrack(List<List<Integer>> result,int level,TreeNode root){
        if(root == null) return;
        if(result.size() == level){//根据层数对应新增列表
            result.add(new ArrayList<>());
        }
        result.get(level).add(root.val);//往刚才新增的空列表里插入值
        if(root.left != null) backTrack(result,level+1,root.left);
        if(root.right != null) backTrack(result,level+1,root.right);
    }

}