[LeetCode]102. Binary Tree Level Order Traversal&107. Binary Tree Level Order Traversal II

102 . Binary Tree Level Order Traversal
Easy

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]
]

1ms:

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

2ms:

 public List<List<Integer>> levelOrder(TreeNode root) {
       if(root==null) return new ArrayList<List<Integer>>();

        Queue<TreeNode> q = new LinkedList<TreeNode>();
        q.add(root);
        int count = 0;
        int sum = 1;
        List<List<Integer>> re = new ArrayList<List<Integer>>();
        List<Integer> level = new ArrayList<Integer>();
        while(!q.isEmpty()){
            TreeNode tn = q.poll();
            level.add(tn.val);
            if(tn.left!=null){
                q.add(tn.left);
                count++;
            }
            if(tn.right!=null){
                q.add(tn.right);
                count ++;
            }

            if((--sum)==0){
                re.add(level);
                sum = count;
                count = 0;
                level = new ArrayList<Integer>();
            }
        }
        return re;
    }

2ms:

public List<List<Integer>> levelOrder_(TreeNode root){
         List<List<Integer>> re = new ArrayList<List<Integer>>();
         if(root == null) return re;
         Queue<TreeNode> q = new LinkedList<TreeNode>();
         q.offer(root);
         while(!q.isEmpty()){
             int levelNum = q.size();
             List<Integer> level = new ArrayList<Integer>();
             for(int i=0;i<levelNum;i++){
                 if(q.peek().left!=null) q.offer(q.peek().left);
                 if(q.peek().right!=null) q.offer(q.peek().right);
                 level.add(q.poll().val);
             }
             re.add(level);
         }
         return re;
     }

107 . Binary Tree Level Order Traversal II
Easy

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]
]

public class Solution {
    public List<List<Integer>> levelOrderBottom(TreeNode root) {
         List<List<Integer>> re = new ArrayList<List<Integer>>();
         getLevelOrder(root,0,re);
         Collections.reverse(re);
         return re;
    }
    private void getLevelOrder(TreeNode tn,int level,List<List<Integer>> re){
         if(tn==null) return ;
         if(re.size()<=level){
             re.add(new ArrayList<Integer>());
         }
         re.get(level).add(tn.val);
         getLevelOrder(tn.left,level+1,re);
         getLevelOrder(tn.right,level+1,re);
     }
}