剑指offer23

package targetOffer;

import java.util.ArrayDeque;
import java.util.Queue;

import targetOffer.Mirror_19.Node;

public class PrintTree_23 {
	 class Node{
			private int value;
			Node right;
			Node left;
			public Node(int value,Node left,Node right)
			{
				this.value=value;
				this.right=right;
				this.left=left;
			}
			public Node(int i)
			{
				value=i;
				right=null;
				left=null;
			}
		}
	void printTree(Node root)
	{
		if(root==null)
			return ;
		Queue<Node> listNode=new ArrayDeque<Node>();
		listNode.add(root);
		while(!listNode.isEmpty()){
			Node temp=listNode.poll();
			System.out.print(temp.value+"\t");
			if(temp.left!=null)
				listNode.offer(temp.left);
			if(temp.right!=null)
				listNode.offer(temp.right);	
			
		}
		System.out.println();
		
	}
	void test()
	{
		Node root=new Node(8);
		Node node1=new Node(6);
		Node node2=new Node(10);
		Node node3=new Node(5);	 
		Node node4=new Node(7);
		Node node5=new Node(9);
		Node node6=new Node(11);
		root.left=node1;
		root.right=node2;
		node1.left=node3;
		node1.right=node4;
		node2.left=node5;
		node2.right=node6;
		
		printTree(root);
	}
	public static void main(String args[])
	{
		new PrintTree_23().test();
	}
}

书中测试用例的测试结果：8 6 10 5 7 9 11