-let get_ancestor tree ln =
- let rec aux tree l1 acc =
- match l1 with
- [] -> acc
- | _ -> let ll1 = get_parent tree l1 in
- let acc1 = union_list tree acc ll1 in
- aux tree ll1 acc1
- in
- let l = aux tree ln [] in
- l
-
-let get_preSibling tree ln =
+let get_ancestor tree b v =
+ let v0 = Bitvector.create (Naive_tree.size tree) in
+ (* let v = bitvector_of_nodes tree ln in *)
+ if b then
+ begin
+ for i = (Bitvector.length v)-1 downto 0 do
+ if Bitvector.get v i then
+ begin
+ Bitvector.set v0 i true;
+ let n = Naive_tree.by_preorder tree i in
+ let n0 = ref n in
+ while !n0 != Naive_tree.nil do
+ let n1 = get_firstBling tree !n0 Naive_tree.nil in
+ let n2 = Naive_tree.parent_of_first tree n1 in
+ n0 := n2;
+ if n2 != Naive_tree.nil then begin let j = Naive_tree.preorder tree n2 in
+ Bitvector.set v0 j true;
+ Bitvector.set v j true;
+ end
+ done;
+ end
+ done;
+ end
+ else
+ for i = (Bitvector.length v)-1 downto 0 do
+ if Bitvector.get v i then
+ begin
+ let n = Naive_tree.by_preorder tree i in
+ let n0 = ref n in
+ while !n0 != Naive_tree.nil do
+ let n1 = get_firstBling tree !n0 Naive_tree.nil in
+ let n2 = Naive_tree.parent_of_first tree n1 in
+ n0 := n2;
+ if n2 != Naive_tree.nil then begin let j = Naive_tree.preorder tree n2 in
+ Bitvector.set v0 j true;
+ Bitvector.set v j true;
+ end
+ done;
+ end
+ done;
+ v0
+
+let get_preSibling tree v =