倒反天罡树

package com.example;

public class Node {
    private int value;
    private Node left;
    private Node right;
    Node(){

    }
    Node(int v){
        value=v;
    }
    Node(int v,Node l,Node r){
        value=v;
        left=l;
        right=r;
    }

    public int getValue() {
        return value;
    }

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

    public Node getLeft() {
        return left;
    }

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

    public Node getRight() {
        return right;
    }

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

package com.example;

public class Root extends Node {
    private Node upLeft;
    private Node upRight;

    Root(int v){
        super(v);
    }
    public Node getUpLeft() {
        return upLeft;
    }

    public void setUpLeft(Node upLeft) {
        this.upLeft = upLeft;
    }

    public Node getUpRight() {
        return upRight;
    }

    public void setUpRight(Node upRight) {
        this.upRight = upRight;
    }
}

package com.example;

public class NodeTest {
    public static void main(String[] args) {
        Root root=new Root(1);
        Node left=new Node(2);
        Node upleft=new Node(4);
        Node right=new Node(3);
        Node upright=new Node(5);
        root.setLeft(left);
        root.setRight(right);
        root.setUpLeft(upleft);
        root.setUpRight(upright);

        Node six=new Node(6);
        Node seven=new Node(7);
        left.setLeft(six);
        left.setRight(seven);
        Node eight=new Node(8);
        Node nine=new Node(9);
        upleft.setLeft(eight);
        upleft.setRight(nine);

        System.out.println(root.getUpLeft().getLeft().getValue());

    }
}