public void insert(int value) {

        Fibonaccinode x = new Fibonaccinode(value);
        x.degree = 0;
        x.parent = null;
        x.child = null;
        x.left = x;
        x.right = x;
        if (min != null) {            
            //solmut linkitetään toisiinsa            
            x.left = min;
            x.right = min.right;
            min.right = x;
            x.right.left = x;
            if (x.value < min.value) {
                min = x;
            }
        } else {
            min = x;
        }
        size++;
    }