es2

class Node {

    public int value;
    public String q;
    public Node left;
    public Node right;

    public Node(int value, String q) {
        this.value = value;
        this.q = q;
        right = null;
        left = null;
    }
}


public class BinaryTree {

    public Node root;

    public Node addRecursive(Node current, int value, String q) {
        if (current == null) {
            return new Node(value,q);
        }

        if (value < current.value) {
            current.left = addRecursive(current.left, value, q);
        } else if (value >= current.value) {
            current.right = addRecursive(current.right, value, q);
        } else {
            // value already exists
            return current;
        }

        return current;
    }

    public void add(int value, String q) {
        root = addRecursive(root, value, q);
    }



    public static void main(String[] args) {
        BinaryTree bt = new BinaryTree();

        bt.add(170, "albergo");
        bt.add(130, "campionato");
        bt.add(90, "fiume");
        bt.add(20, "patate");
        bt.add(8, "frutta");
        bt.add(222, "eletto");
        bt.add(51, "sentieri");

        System.out.println(bt.root.left.left.value);
        System.out.println(bt.root.left.left.q);

    }
}