| Tree | RpmOp |
A tree datastructure | RSAVAGE |
| Tree::AVL | RpdOp |
AVL tree for efficient storage and retrieval | MBEEBE |
| Tree::DAG_Node | MpdOp |
base class for trees | RSAVAGE |
| Tree::Fat | Rcdf |
Embeddable F-Tree algorithm suite | JPRIT |
| Tree::Interval | bpdOp |
Perl implementation of an interval tree | GNB |
| Tree::List2Tree | apdhp |
Convert list of nodes into tree structure | THW |
| Tree::Menu | bpdOp |
Menus as trees | PSHARPE |
| Tree::Nary | RpdOp |
Perl implementation of N-ary search trees | FSORIANO |
| Tree::Node | bcdhp |
Memory-efficient tree node implementation | RRWO |
| Tree::Predicate | bpdfa |
predicate trees, usually for SQL | MARSHALL |
| Tree::Range | bpdOb |
Map ranges to values using an arbitrary tree | ONEGRAY |
| Tree::Suffix | bcdOp |
Interface to the libstree library | GRAY |
| Tree::Ternary | bpdOp |
Perl implementation of ternary search trees | MROGASKI |
| Tree::Ternary_XS | acdOp |
XS implementation of ternary search trees | LBROCARD |
| Tree::Trie | bpdO |
An implementation of the Trie data structure | AVIF |
