1.背景
1. 由于二叉树的线索化之后,大部分节点的指针指向发生了变化,所以不能使用普通的遍历方法,而是利用其特性
2. 本程序演示的是中序二叉树的线索化,所以遍历的顺序和二叉树的线索化的顺序一样
2.代码实现
1.节点
public class BinaryTreeNodes {
private int id;
private String name;
private BinaryTreeNodes left;
private BinaryTreeNodes right;
private int leftType;
private int rightType;
public BinaryTreeNodes() {
}
public BinaryTreeNodes(int id, String name) {
this.id = id;
this.name = name;
}
public int getLeftType() {
return leftType;
}
public void setLeftType(int leftType) {
this.leftType = leftType;
}
public int getRightType() {
return rightType;
}
public void setRightType(int rightType) {
this.rightType = rightType;
}
public int getId() {
return id;
}
public void setId(int id) {
this.id = id;
}
public String getName(