Java二叉树按层次遍历，换行输出

import java.util.LinkedList;
import java.util.Queue;

public class Node {
	public int value;

	public Node left;

	public Node right;

	public Node(int v) {
		this.value = v;
		this.left = null;
		this.right = null;
	}

	public static void main(String args[]){
		StringBuffer str = new StringBuffer();
		str.append("hello world");
		String test = str.toString();
		System.out.println(test.replace(" ", "%20"));
		
		Node n1 = new Node(1);
		Node n2 = new Node(2);
		Node n3 = new Node(3);
		Node n4 = new Node(4);
		Node n5 = new Node(5);
		Node n6 = new Node(6);
		Node n7 = new Node(7);
		Node n8 = new Node(8);
		Node n9 = new Node(9);
		Node n10 = new Node(10);
		n1.left = n2;
		n1.right = n3;
		n2.left = n4;
		n2.right = n5;
		n3.left = n6;
		n3.right =n7;
		n4.left = n8;
		n4.right = n9;
		n5.left = n10;
		levelTravel(n1);
	}
	
	/**
	 *