1 This module implements a memory-efficient node type (for trees, skip lists
2 and similar data structures) for Perl.
4 You may ask "Why bother implementing an ordered structure such as a tree
5 when Perl has hashes built-in?" Since Perl is optimized for speed over
6 memory usage, hashes (and lists) use a lot of memory.
8 So the purpose of this package is to provide a simple low-level Node class
9 which can be used as a base class to implement various kinds of tree
10 structures. Each node has a key/value pair and a variable number of
13 How nodes are organized or the algorithm used to organize them is for you
16 There is no Pure-perl version because this package was written to overcome
19 WWW: http://search.cpan.org/dist/Tree-Node/