Java实现BFS广度遍历二叉树

用队列实现BFS

private static <T extends Comparable<T>> void bfs2(BTree<T>.BNode node, Queue<BNode> queue) {
		if (node == null)
			return;
		queue.offer(node);
		while (!queue.isEmpty()) {
			BNode temp = queue.poll();
			System.out.print(temp.value + "  ");
			if (temp.left != null)
					queue.offer(temp.left);
			if (temp.right != null)
					queue.offer(temp.right);
		}
	}