按层打印二叉树

• 按层打印二叉树，即同层节点从左至右打印每个节点。例如下图，打印结果是：1-2-3-4-5-6-7

 

import java.util.ArrayList;
import java.util.LinkedList;
import java.util.List;
import java.util.Queue;

public class TreePrint {

    public static void main(String[] args) {
        TreeNode treeNode1 = new TreeNode(1);
        TreeNode treeNode2 = new TreeNode(2);
        TreeNode treeNode3 = new TreeNode(3);
        TreeNode treeNode4 = new TreeNode(4);
        TreeNode treeNode5 = new TreeNode(5);

        treeNode1.left = treeNode2;
        treeNode1.right = treeNode3;
        treeNode2.left = treeNode4;
        treeNode2.right = treeNode5;

        TreeOperation.show(treeNode1);
        List<Integer> list = printTree(treeNode1);
        list.stream().forEach(i-> System.out.println(i));
    }


    public static List<Integer> printTree(TreeNode head){

        List<Integer> list = new ArrayList<>();
        if(head==null){
            return list;
        }

        Queue<TreeNode> queue = new LinkedList<>();
        queue.add(head);

        while (!queue.isEmpty()){
            TreeNode treeNode = queue.poll();

            if(treeNode.left != null){
                queue.add(treeNode.left);
            }

            if(treeNode.right != null){
                queue.add(treeNode.right);
            }

            list.add(treeNode.val);
        }

        return list;
    }
}