Binary Tree Level Order Traversal

/**
 * Definition for binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public ArrayList<ArrayList<Integer>> levelOrder(TreeNode root) {
        ArrayList<ArrayList<Integer>> res = new ArrayList<ArrayList<Integer>>();
		if(root == null){
			return res;
		}
		ArrayList<TreeNode> tmp = new ArrayList<TreeNode>();
		tmp.add(root);
		while(tmp.size() != 0){
			ArrayList<TreeNode> next = new ArrayList<TreeNode>();
			ArrayList<Integer> thisLevelNode = new ArrayList<Integer>();
			for(int i = 0 ; i < tmp.size() ; i++){
				thisLevelNode.add(tmp.get(i).val);
				if(tmp.get(i).left != null){
					next.add(tmp.get(i).left);
				}
				if(tmp.get(i).right != null){
					next.add(tmp.get(i).right);
				}
			}
			tmp = next;
			res.add(thisLevelNode);
		}
		return res;
    }
}

原来之前做的是

Binary Tree Level Order Traversal

  II ，现在做的是I，这样就直接打完就过了