Обход бинарного дерева generi c

Question

Абстрактное двоичное дерево должно быть создано с использованием обобщенного класса c. Каждый узел имеет строковое значение, а также значение initialCalculatedValue. Не следует вносить никаких изменений в основной класс, а внутренний класс c должен быть включен в общий c класс. Мне нужен совет по поводу моего кода, так как основной класс выдает ошибку при доступе к «timesVisited» и «values». Мой код не может получить доступ к этим переменным.

Код основного класса:

public class Main{
    public static void main(String[] args) {        
        WalkableTree<String, Integer> ast = new WalkableTree<>(0);

        WalkableTree.Node<String, Integer> plus = ast.setRoot("+");
        plus.setRightChild("20");

        WalkableTree.Node<String, Integer> multiply = plus.setLeftChild("*");
        multiply.setLeftChild("10");

        WalkableTree.Node<String, Integer> bracketedPlus = multiply.setRightChild("+");
        bracketedPlus.setLeftChild("3");
        bracketedPlus.setRightChild("4");

        // write visitor to display pre-order
        System.out.println("Pre-order traversal:");
        ast.walk(current -> {
            if(current.timesVisited == 2)
                System.out.print(current.value + " ");
        });
        System.out.println();

        // write visitor to display in-order
        System.out.println("In-order traversal:");
        ast.walk(current -> {
            if(current.timesVisited == 3)
                System.out.print(current.value + " ");
        });
        System.out.println();

        // write visitor to display post-order
        System.out.println("Post-order traversal:");
        ast.walk(current -> {
            if(current.timesVisited == 4)
                System.out.print(current.value + " ");
        });
        System.out.println();
    }
}

Функциональный интерфейс:

@FunctionalInterface
public interface Visitor<N> {
    public void visit(N node);
}

Generi c class:

public class WalkableTree <T, R> {

     private T root = null;
     private R initialCalculatedValue;
     public static Node current;

    public WalkableTree(R initialCalculatedValue) {
        this.initialCalculatedValue = initialCalculatedValue;
    }

    public Node getRoot() {
        return (Node) root;
    }

    public Node setRoot(T value) {
        current = new Node(null,null,null,value,null,0);
        return current;
    }

    public R getInitialCalculatedValue() {
        return initialCalculatedValue;
    }

    public void setInitialCalculatedValue(R initialCalculatedValue) {
        this.initialCalculatedValue = initialCalculatedValue;
    }

    protected void reset(Node node) {
        node.timesVisited = 0;
        node.calculatedValue = initialCalculatedValue;
        reset((Node) node.leftChild);
        reset((Node) node.rightChild);
    }

    public Node nextNode(Node node) {
        node.timesVisited++;
        if(node.timesVisited == 1)
            return node;

        if(node.timesVisited == 2)
            return (Node) node.leftChild;

        if(node.timesVisited == 3)
            return (Node) node.rightChild;

        if(node.timesVisited == 4)
            return (Node) node.getParent();

        return node;
    }

    public void walk(Visitor visitor) {
        //Reset all the nodes in the tree
        reset((Node) root);

        //Set the current node to visit at the root of the tree
        visitor.visit(root);

        //Walking through the tree as long as the current node still exists
            //If current node exists, let the visitor object visit the current node
            //Current node is set to the next node using nextNode() method
        while (this.current == current)
        {
            nextNode(current);
        }
    }

    public static class Node<T, R> {
        //Variables
        Object leftChild;
        Object rightChild;
        Object parent;
        T value;
        R calculatedValue;
        int timesVisited = 0;

        public Node(Object leftChild, Object rightChild, Object parent, T value, R calculatedValue, int timesVisited) {
            this.leftChild = leftChild;
            this.rightChild = rightChild;
            this.parent = parent;
            this.value = value;
            this.calculatedValue = calculatedValue;
            this.timesVisited = timesVisited;
        }

        public Object getLeftChild() {
            return leftChild;
        }

        public Node setLeftChild(T value) {
            Node newLeft = new Node(null,null, current,value,0,0);
            current = newLeft;
            return current;
        }

        public Object getRightChild() {
            return rightChild;
        }

        public Node setRightChild(T value) {
            Node newRight = new Node(null,null, current,value,0,0);
            current = newRight;
            return current;
        }

        public Object getParent() {
            return parent;
        }

        public void setParent(Node parent) {
            this.parent = parent;
        }

        public T getValue() {
            return value;
        }

        public void setValue(T value) {
            this.value = value;
        }

        public R getCalculatedValue() {
            return calculatedValue;
        }

        public void setCalculatedValue(R calculatedValue) {
            this.calculatedValue = calculatedValue;
        }

        public int getTimesVisited() {
            return timesVisited;
        }

        public void setTimesVisited(int timesVisited) {
            this.timesVisited = timesVisited;
        }
    }
}

Answer 1

Обновите метод в WalkableTree, как показано ниже:

 public void walk(Visitor<Node> visitor) {
        //Reset all the nodes in the tree
        reset((Node) root);

        //Set the current node to visit at the root of the tree
        visitor.visit((Node) root);

        //Walking through the tree as long as the current node still exists
        //If current node exists, let the visitor object visit the current node
        //Current node is set to the next node using nextNode() method
        while (this.current == current)
        {
            nextNode(current);
        }
    }