二叉树按层打印

1.主要考察对二叉树的宽度优先遍历

2.宽度优先遍历采用队列结构

源代码如下：

import java.util.LinkedList;

import java.util.Queue;
import java.util.ArrayList;
import java.util.Iterator;
public class BinaryTree{
	private static class BinaryTreeNode{
		private int val;
		private BinaryTreeNode left;
		private BinaryTreeNode right;
		
		public BinaryTreeNode() {
			
		}
		
		public BinaryTreeNode(int val) {
			this.val = val;
		}
		
		public String toString() {
			return val + "" ;	
		}
	}
	
	public static ArrayList<Integer> printTree(BinaryTreeNode root) {
		
		ArrayList<Integer> list = new ArrayList<Integer>();
		Queue<BinaryTreeNode> queue = new LinkedList<>();
		
		if(null == root) {
			return list;
		}
		
		queue.offer(root);
		while(!queue.isEmpty()) {
			BinaryTreeNode node = queue.poll();
			if(node.left != null) {
				queue.offer(node.left);
			}
			if(node.right != null) {
				queue.offer(node.right);
			}
			list.add(node.val);
		}
		return list;
	}
	
	
	public static void main(String[] args) {
		BinaryTreeNode n1 = new BinaryTreeNode(1);
		BinaryTreeNode n2 = new BinaryTreeNode(2);
		BinaryTreeNode n3 = new BinaryTreeNode(3);
		BinaryTreeNode n4 = new BinaryTreeNode(4);
		BinaryTreeNode n5 = new BinaryTreeNode(5);
		BinaryTreeNode n6 = new BinaryTreeNode(6);
		BinaryTreeNode n7 = new BinaryTreeNode(7);
		BinaryTreeNode n8 = new BinaryTreeNode(8);
		BinaryTreeNode n9 = new BinaryTreeNode(9);
		
		ArrayList<Integer> result = new ArrayList<Integer>();
		n1.left = n2;
		n1.right = n3;
		n2.left = n4;
		n2.right = n5;
		n3.left = n6;
		n3.right = n7;
		n6.left = n8;
		n6.right = n9;
		
		result = printTree(n1);
		for(Iterator it = result.iterator(); it.hasNext();) {
			System.out.print(it.next());
		}
		System.out.println("Run Success");
	}
}