26 #include <mln/util/tree.hh>
27 #include <mln/util/tree_to_fast.hh>
28 #include <mln/util/tree_fast.hh>
45 node2->add_child(elt4);
46 node2->add_child(elt5);
49 node3 = node2->search(elt1);
50 mln_assertion(!node3);
53 tre->add_tree_up(elt6);
54 mln_assertion (tre->check_consistency());
58 mln_assertion(tree_fast.has (elt1));
59 mln_assertion(tree_fast.has (elt2));
60 mln_assertion(tree_fast.has (elt3));
61 mln_assertion(tree_fast.has (elt4));
62 mln_assertion(tree_fast.has (elt5));
63 mln_assertion(tree_fast.has (elt6));
64 mln_assertion(tree_fast.search(elt6) == tree_fast.root_);