二叉树的概念
代码示例:
//定义BinaryTree
class BinaryTree{
private HeroNode root;
public void setRoot(HeroNode root) {
this.root = root;
}
//前序遍历
public void preOrder(){
if(this.root!=null){
this.root.preOrder();
}else {
System.out.println("二叉树为空,无法遍历");
}
}
//中序遍历
public void infixOrder(){
if(this.root!=null){
this.root.infixOrder();
}else {
System.out.println("二叉树为空,无法便利");
}
}
//后序遍历
public void postOrder(){
if(this.root!=null){
this.root.postOrder();
}else {
System.out.println("二叉树为空,无法遍历");
}
}
}
//先创建 HeroNode 结点
class HeroNode{
private int no;
private String name;
private HeroNode left;
private HeroNode right;
public HeroNode(int no,String name){
this.no=no;
this.name=name;
}
public int getNo() {
return no;
}
public void setNo(int no) {
this.no = no;
}
public String getName() {
return name;
}
public void setName(String name) {
this.name = name;
}
public HeroNode getLeft() {
return left;
}
public void setLeft(HeroNode left) {
this.left = left;
}
public HeroNode getRight() {
return right;
}
public void setRight(HeroNode right) {
this.right = right;
}
@Override
public String toString() {
return "HeroNode [no=" + no + ", name=" + name + "]";
}
//编写前序遍历的方法
public void preOrder(){
System.out.println(this);//先输出父结点
//递归向左子树前序遍历
if(this.left!=null){
this.left.preOrder();;
}
//递归向右子树前序遍历
if(this.right!=null){
this.right.preOrder();
}
}
//中序遍历
public void infixOrder(){
//递归向左子树中序遍历
if(this.left!=null){
this.left.infixOrder();
}
//输出夫结点
System.out.println(this);
//递归向右子树中序遍历
if(this.right!=null){
this.right.infixOrder();
}
}
//后序遍历
public void postOrder(){
if(this.left!=null){
this.left.postOrder();
}
if(this.right!=null){
this.right.postOrder();
}
System.out.println(this);
}
}
创建结点:
//创建需要的节点
HeroNode root = new HeroNode(1, "乾坤");
HeroNode node2 = new HeroNode(2, "李永钦");
HeroNode node3 = new HeroNode(3, "小俊");
HeroNode node4 = new HeroNode(4, "董思成");
HeroNode node5 = new HeroNode(5, "皇冠哼");
/我们先手动创建该二叉树,后面我们学习以递归的方式创建二叉树
root.setLeft(node2);
root.setRight(node3);
node3.setRight(node4);
binaryTree.setRoot(root);
//测试
System.out.println("后序遍历");//1,2,3,4
binaryTree.postOrder();
效果截图:
加上中序遍历和前序遍历:
加上node5之后:
代码学自尚硅谷。