Java代码实现二叉树前序中序后序层序遍历

Java代码实现二叉树前序中序后序层序遍历

Node结点类

public class Node {
   
    // 左子结点
    public Node left;
    // 右子结点
    public Node right;
    // 结点的值
    public String value;

    public Node(String value) {
   
        this.value = value;
    }

    @Override
    public String toString() {
   
        return value;
    }
}

Tree树类

public class Tree {
   
    // 根节点
    public Node root;

    public Tree(String s) {
   
        root = createTree(s,0);
    }

    // 层序创建二叉树
    public Node createTree(String s, int index) {
   
        if (index < 0 || index >= s.length() || " ".equals(s.charAt(index) + "")) return null;

        Node node = new Node(s.charAt(index) + "");
        node.left = (createTree(s, index * 2 + 1));
        node.right = (createTree(</