题解 | #牛群分层排列#

import java.util.*;

/*
 * public class TreeNode {
 *   int val = 0;
 *   TreeNode left = null;
 *   TreeNode right = null;
 *   public TreeNode(int val) {
 *     this.val = val;
 *   }
 * }
 */

public class Solution {
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     *
     * @param root TreeNode类
     * @return string字符串一维数组
     */
    public String[] levelOrder (TreeNode root) {
        List<String> list = new ArrayList();
        Queue<TreeNode> queue =  new LinkedList();
        if (root == null) return new String[] {};
        queue.add(root);
        while (!queue.isEmpty()) {
            String str = "";
            for (TreeNode temp : queue) {
                str += temp.val;
            }
            list.add(str);

            int size = queue.size();
            while (size-- > 0) {
                TreeNode node = queue.poll();
                if (node.left != null) {
                    queue.add(node.left);
                }
                if (node.right != null) {
                    queue.add(node.right);
                }
            }
        }
        return list.toArray(new String[list.size()]);
    }
}