A mutable n-ary tree with async support.
This library provides a simple way to define, mutate and traverse trees of an arbitrary and non-constant arity. In addition, regarding to traversal algorithms, six different implementations are included: the immutable, mutable and owned approaches, as well as the synchronous and asynchronous strategies for each of them.