t.interleaved = false;
    BddTree bddtree_new(int id) {        BddTree t = new BddTree();        t.first = t.last = -1;        t.fixed = true;        t.next = t.prev = t.nextlevel = null;        t.seq = null;        t.id = id;        return t;    }