根据二叉树先根序列和中根序列生成二叉树java

1. 运行结果

---

2. 节点类

package Class.Binarytree;

public class BinaryNode {
    private String data;
    BinaryNode left, right;

    public BinaryNode(String data) {
        this.data = data;
    }

    public BinaryNode(String data, BinaryNode left, BinaryNode right) {
        this.data = data;
        this.left = left;
        this.right = right;
    }

    public String toString() {
        return data;
    }

}

---

3. 二叉树类

package Class.Binarytree;

public class BinaryTree {
    private BinaryNode root;

    public BinaryTree(String preStr, String inStr) {
        root = this.preBuild(preStr, inStr);
    }

    // 通过前序和中序遍历获得二叉树
    // ABDFIGCEH  BIFDGAEJHC
    // 1.获取先根序列首个字母 father 并将创建该节点
    // 2.从中跟序列中找到该字母索引inIndex
    // 3.并且通过substring(0,inIndex)获得左树对应中根序列inLeft,同样地获取右树中根序列inRight,
    // 4.获得当前根节点的左树前根序列preLeft和右树前根序列preRight

    public BinaryNode preBuild(String preStr, String inStr) {
        String fatherAlpha;
        BinaryNode father;
        BinaryNode leftSon;
        BinaryNode rightSon;

        fatherAlpha = preStr.substring(0, 1);
        father = new BinaryNode(fatherAlpha);
        int inIndex = inStr.indexOf(fatherAlpha);
        int leftLength = 0;
        // 1. 需要考虑到subString索引越界的问题
        // 2. 需要考虑到递归结束的条件

        if (inIndex != 0) { // 当中跟序列根节点左边有字母时
            String inLeft = inStr.substring(0, inIndex);
            leftLength = inLeft.length();
            String preLeft = preStr.substring(1, leftLength + 1);
            father.left = preBuild(preLeft, inLeft);
        }
        if (inIndex + 1 != inStr.length()) { // 当中跟序列根节点右边有字母时
            String inRight = inStr.substring(inIndex + 1);
            String preRight = preStr.substring(leftLength + 1);
            father.right = preBuild(preRight, inRight);
        }
        return father;
    }

    // 通过中序和后续遍历获得二叉树
    public void postBuild(String inStr, String postStr) {

    }

    // 前序遍历
    public void preOrder() {
        preOrder(root);
        System.out.println("");
    }

    public void preOrder(BinaryNode node) {
        if (node != null) {
            System.out.print(node.toString());
            preOrder(node.left);
            preOrder(node.right);
        }
    }

    // 中序遍历
    public void inOrder() {
        inOrder(root);
        System.out.println("");
    }

    public void inOrder(BinaryNode node) {
        if (node != null) {
            inOrder(node.left);
            System.out.print(node.toString());
            inOrder(node.right);
        }
    }

    // 后续遍历
    public void postOrder() {
        postOrder(root);
        System.out.println("");
    }

    public void postOrder(BinaryNode node) {
        if (node != null) {
            postOrder(node.left);
            postOrder(node.right);
            System.out.print(node.toString());
        }
    }
}

---

4. 主类

package Class.Binarytree;

public class main {
    public static void main(String[] args) {
        BinaryTree tree1 = new BinaryTree("DFIG", "IFDG");
        tree1.preOrder();
        tree1.inOrder();
        tree1.postOrder();
        BinaryTree tree2 = new BinaryTree("ABCDEF", "CBAEDF");
        tree2.preOrder();
        tree2.inOrder();
        tree2.postOrder();
        BinaryTree tree3 = new BinaryTree("ABCIDEHFJG","BICAHEJFGD");
        tree3.preOrder();
        tree3.inOrder();
        tree3.postOrder();
    }
}