LeeCode刷题日记 102.二叉树的层次遍历

102. 二叉树的层次遍历
     .给定一个二叉树，返回其按层次遍历的节点值。 （即逐层地，从左到右访问所有节点）。

例如:
给定二叉树: [3,9,20,null,null,15,7],

3

/
9 20
/
15 7
返回其层次遍历结果：

[
[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; }
 * }
 */
 1.BFS
class Solution {
    public List<List<Integer>> levelOrder(TreeNode root) {
if(root == null)return new ArrayList<>();
    List<List<Integer>> res = new ArrayList<>();
    Queue<TreeNode> queue = new LinkedList<>();
    queue.add(root);
    while(!queue.isEmpty()){
        int count = queue.size();
        List<Integer> list = new ArrayList<Integer>();
        while(count > 0){
            TreeNode node = queue.poll();
            list.add(node.val);
            if(node.left != null)
                queue.add(node.left);
            if(node.right != null)
                queue.add(node.right);
            count--;
        }
        res.add(list);
    }
    return res;
    }
}

2.DFS

/**
 * 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>>  res = new ArrayList<>();
        if(root==null){
                return res;
        }
        levelOrder(root,0,res);
        return  res;
    }
     public void levelOrder(TreeNode root,int level,List<List<Integer>> res) {
            if(res.size()==level) {
			res.add(new ArrayList<Integer>());
	    	}
            res.get(level).add(root.val);
            if(root.left!=null){
                levelOrder(root.left,level+1,res);
            }
            if(root.right!=null){
                levelOrder(root.right,level+1,res);
            }
    }

}