let n1 = Naive_tree.first_child tree n in
aux n1 [] ) ln in
get_list_ordred tree ll
- (* let l = List.fold_left (fun acc n -> if List.mem n acc then acc
- else let n1 = Naive_tree.first_child tree n in
- aux n1 acc) [] ln
- in
- List.rev l *)
let get_child tree ln =
let rec aux n acc =