package datavisor;

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

/**
 * 二叉树 层次遍历
 */
public class Test1222 {

 public static class InnerTree {
 private InnerTree left;
 private InnerTree right;
 private String value;
 }

 private static final Queue<InnerTree> queue = new LinkedList<>();

 public static void main(String[] args) {
 InnerTree root = new InnerTree();
 // add node ...
 queue.add(root);
 while (!queue.isEmpty()) {
 InnerTree header = queue.poll();
 // 输出
 System.out.println(header.value);
 // 添加左节点
 if (header.left!=null) {
 queue.add(header.left);
 }
 // 添加右节点
 if (header.right != null) {
 queue.add(header.right);
 }
 }
 }
}