第一部分:二叉树的层序遍历(队列实现)
一、定义二叉树结点Node类
package binaryTree.bean;
/*
* 二叉树的结点
*/
public class Node {
private int data;
private Node left;
private Node right;
public Node(int data,Node left,Node right){
this.data = data;
this.left = left;
this.right = right;
}
public int getData(){
return data;
}
public void setData(int data){
this.data = data;
}
public Node getLeft(){
return left;
}
public void setLeft(Node left){
this.left = left;
}
public Node getRight(){
return right;
}
public void setRight(Node right){
this.right = right;
}
}
二、层序遍历(不换行,不打印行号)
/*
* 层序遍历
* 每一层都是从左到右的遍历输出,借助于队列实现。offer()为入队,poll()为出队