线索化二叉树

定义线索二叉树类 

//实现线索化功能的二叉树
class ThreadedBinaryTree {
    private TreeNode root;
    private TreeNode pre = null;//创建当前节点的前驱结点的指针

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

    public void threadedNodes() {
        threadedNodes(root);
    }

    /**
     * 编写对二叉树进行 中序线索化 方法
     *
     * @param node 当前需要线索化的结点
     */
    public void threadedNodes(TreeNode node) {
        if (node == null) {
            return;
        }
        //先线索化左子树
        threadedNodes(node.getLeft());
        //线索化当前结点
        //处理当前结点node的前驱结点pre
        if (node.getLeft() == null) {
            //让当前结点的左指针指向前驱结点
            node.setLeft(pre);
            node.setLeftType(1);
        }
        //处理当前结点pre的后继结点node（这一步比较难理解，处理后继节点其实是在下一次才处理的）
        if (pre != null && pre.getRight() == null) {
            //让前驱结点的右指针指向当前结点
            pre.setRight(node);
            pre.setRightType(1);
        }
        //每处理一个结点，让当前结点是下一个结点的前驱结点
        pre = node;
        //后线索化右子树
        threadedNodes(node.getRight());
    }
}

定义树结点类

class TreeNode {
    private int no;
    private String name;
    private TreeNode left;
    private TreeNode right;

    private int leftType;  //0代表指向的是左子树，1代表指向的是前驱节点
    private int rightType; //0代表指向的是右子树，1代表指向的是后继节点

    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 TreeNode(int no, String name) {
        this.no = no;
        this.name = name;
    }

    @Override
    public String toString() {
        return "TreeNode{" +
                "no=" + no +
                ", 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 TreeNode getLeft() {
        return left;
    }

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

    public TreeNode getRight() {
        return right;
    }

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

测试类

public class ThreadedBinaryTreeDemo {
    public static void main(String[] args) {
        TreeNode root = new TreeNode(1, "jessica");
        TreeNode node2 = new TreeNode(3, "karry");
        TreeNode node3 = new TreeNode(6, "mary");
        TreeNode node4 = new TreeNode(8, "kitty");
        TreeNode node5 = new TreeNode(10, "jane");
        TreeNode node6 = new TreeNode(14, "tom");
        //测试中序线索化
        ThreadedBinaryTree threadedBinaryTree = new ThreadedBinaryTree();
        threadedBinaryTree.setRoot(root);
        root.setLeft(node2);
        root.setRight(node3);
        node2.setLeft(node4);
        node2.setRight(node5);
        node3.setLeft(node6);
        threadedBinaryTree.threadedNodes();

        TreeNode leftNode = node2.getLeft();
        System.out.println("3号节点的前驱节点是：" + leftNode);
        TreeNode rightNode = node2.getRight();
        System.out.println("3号节点的后继节点是：" + rightNode);
    }
}

 

线索二叉树中序遍历 

public void threadedList(){
        //定义一个变量，存储当前遍历的节点，从root开始
        TreeNode node=root;
        while (node!=null){
            //循环找到leftType==1节点，第一个就找到节点8
            while (node.getLeftType()==0){
                node=node.getLeft();
            }
            System.out.println(node);
            //如果当前节点的右指针指向的是后继节点，就一直输出
            while (node.getRightType()==1){
                node=node.getRight();
                System.out.println(node);
            }
            //替换这个遍历的节点
            node=node.getRight();
        }
    }

        System.out.println("使用线索化方式遍历 线索化二叉树");
        threadedBinaryTree.threadedList();