//树节点
/**
class treeNode{
int data;
treeNode left = null;
treeNode right = null;
public treeNode(int data) {
this.data = data;
}
}
*/
思路:先将根节点放入队列,然后每次从队列中取值打印,若这个节点有子节点,则将子节点放入队尾,直到队列为空。
public void layerTranverse(treeNode root) {
//
Queue<treeNode> queue = new LinkedList<treeNode>();
if(root != null)
queue.offer(root);
while(!queue.isEmpty()) {
treeNode node = queue.poll();
System.out.print(node.data);
System.out.print(" ");
if(node.left!=null)
queue.offer(node.left);
if(node.right!=null)
queue.offer(node.right);
}
}