线索化二叉树

线索化就是在节点上新增加前驱和后继。（左右指针都用上了，就不能有 前驱和后继了）
注意：线索化二叉树后，Node节点的 left 和 right 有如下情况：

• 1.left指向的是左子树 也有可能指向前驱节点
• 2.right指向的是右子树 也有可能指向的后继节点

来个图：

代码实现：

package tree.threadedBinaryTree;

public class ThreadedBinaryTree {
    public static void main(String[] args) {
        int[] arr = {1, 2, 3, 4, 5, 4, 6, 7};
        HreoNode root = new HreoNode(1,"宋江");
        HreoNode node2 = new HreoNode(3,"吴用");
        HreoNode node3 = new HreoNode(6,"林冲");
        HreoNode node4 = new HreoNode(8,"呼延灼");
        HreoNode node5 = new HreoNode(10,"柴进");
        HreoNode node6 = new HreoNode(14,"武松");

        root.setLeft(node2);
        root.setRight(node3);
        node2.setLeft(node4);
        node2.setRight(node5);
        node3.setLeft(node6);

        ThreadedBinaryTreeClass t= new ThreadedBinaryTreeClass();
        t.setRoot(root);
        t.threadedNode();
       /* t.midOrder();*/
        //测试
        HreoNode left = node5.getLeft();
        HreoNode right = node5.getRight();
        System.out.println(left);
        System.out.println(right);


    }
}

//线索化二叉树类
class ThreadedBinaryTreeClass {
    private HreoNode root;
    //前驱节点
    private HreoNode preNode;

    //重载线索化方法
    public void threadedNode(){
        this.threadedNode(root);
    }

    //二叉树中序线索化
    //node为当前需要线索化的节点
    public void threadedNode(HreoNode hreoNodeClass) {
        if (hreoNodeClass == null) return;
        //线索化左子树  
        threadedNode(hreoNodeClass.getLeft());
        //线索化当前节点
        if (hreoNodeClass.getLeft() == null) {
            hreoNodeClass.setLeft(preNode);
            //修改左指针类型指向前驱
            hreoNodeClass.setLeftType(1);

        }
        //处理后继节点  想想左下角的叶子结点  pre节点相当于在这个叶子结点前面的空节点
        //，该pre节点的前驱为null,后继为这个叶子结点
        if (preNode != null && preNode.getRight() == null) {
            //前驱节点的右指针只想当前节点
            preNode.setRight(hreoNodeClass);
            preNode.setRightType(1);
        }
        //前驱节点随着递归而变化   pre后移
        preNode = hreoNodeClass;
        //线索化右子树
        threadedNode(hreoNodeClass.getRight());
    }


    public HreoNode getRoot() {
        return root;
    }

    public void setRoot(HreoNode root) {
        this.root = root;
    }


}

class HreoNode {
    private int no;
    private String name;
    //默认null
    private HreoNode left;
    //默认null
    private HreoNode right;

    //left类型   0左子树   1前驱
    private int leftType;
    //right类型   0左子树   1前驱
    private int rightType;




    public HreoNode(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 HreoNode getLeft() {
        return left;
    }

    public void setLeft(HreoNode left) {
        this.left = left;
    }

    public HreoNode getRight() {
        return right;
    }

    public void setRight(HreoNode right) {
        this.right = right;
    }

    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;
    }

    @Override
    public String toString() {
        return "HreoNode{" +
                "no=" + no +
                ", name='" + name + '\'' +
                '}';
    }
}

打印结果：