java二叉树层序遍历

/**
 * @author shq
 * @date 
 */
public class BinaryTreeTraversal {

    public static void main(String[] args) {
        int[] a = {1, 2, 3, 4, 5, 6, 7};
        Integer[] integers1 = Arrays.stream(a).boxed().toArray(Integer[]::new);
        TreeNode root = created(integers1);
        List<List<Integer>> rs = travelTree(root);
        for (List<Integer> list : rs) {
            StringBuilder ab = new StringBuilder();
            list.stream().forEach((Integer s) -> {
                ab.append(s);
            });
            System.out.println(ab.toString());
        }

    }

    /**
    * 创建一颗二叉树
    **/
    public static TreeNode created(Integer data[]) {
        List<TreeNode> list = new ArrayList<TreeNode>();
        for (Integer tempdata : data) {
            list.add(new TreeNode(tempdata));
        }
        TreeNode root = list.get(0);//将第一个元素设置为根节点
        for (int i = 0; i < list.size() / 2; i++) {
            if ((i * 2 + 1) < list.size()) {
                list.get(i).left = list.get(i * 2 + 1);
            }
            if ((i * 2 + 2) < list.size()) {
                list.get(i).right = (list.get(i * 2 + 2));
            }
        }
        return root;
    }

    public static List<List<Integer>> travelTree(TreeNode root){
        List<List<Integer>> result = new LinkedList<>();
        if(null == root){
            return result;
        }
        Queue<TreeNode> queue = new LinkedList();
        queue.add(root);
        while (!queue.isEmpty()){
            int lenth = queue.size();
            List<Integer> list = new LinkedList<>();
            for(int i = 0; i < lenth;i++){
                TreeNode treeNode = queue.poll();
                list.add(treeNode.val);
                if(null != treeNode.left){
                    queue.add(treeNode.left);
                }
                if (null != treeNode.right) {
                    queue.add(treeNode.right);
                }
            }
            result.add(list);
        }
        return result;
    }
}


class TreeNode{
    int val;
    TreeNode left;
    TreeNode right;
    public TreeNode(int val){
        this.val = val;
    }
}