gistfile1.java

void setTree(int[] values) {
    setTree(values, 0, values.length);
}

void setTree(int[] values, int begin, int end) { //pole je např. (2,4,6,8,10,12) a já chci jen (10,12), tak pžedám pole, a begin = 4(index počátečního prvku) a end = 6 (velikost pole+index počátečního prvku)
    int length = end-begin;
    if(length % 2 == 0) {//je sudé
        this.value = values[begin+length/2];
        Node left = new Node();
        this.left = left;
        left.setTree(values, begin, begin+length/2);
        Node right = new Node();
        this.right = right;
        right.setTree(values, begin+length/2+1, begin+length);
    } else {
        this.value = values[begin+(length-1)/2];
        Node left = new Node();
        this.left = left;
        left.setTree(values, begin+0, begin+(length-1)/2);
        Node right = new Node();
        this.right = right;
        right.setTree(values, begin+(length-1)/2+1, begin+length);
    }
}