| Module Info
| Add a review of Tree-Nary
This module implements N-ary Trees. It says in the docs, that it is a reimplementation of some C code. If you look at the code (unfortunatedly one can not rate the code quality here), it truly is a 1:1 implementation. Even lists are implemented as a double linked list and e.g. examining the length of this list requiring an O(n) runtime.
Moreover, every node is considered an object with a hash as the underlying structure. This implies enormous memory usage if you happen to have several thousand of these Trees (each fully grown) in your memory.
The usage of native perl structures such as lists would be more apropriate. This module is suited for a prototype implementation,
not for production code.