libstree is a generic suffix tree implementation,
written in C. It can handle arbitrary data
structures as elements of a string. It is
therefore not limited to simple ASCII character
strings, like most demo implementations of suffix
algorithms are. libstree can handle multiple
strings per suffix tree, including dynamic
insertion and removal of strings. It provides
various means of obtaining information about nodes
in the tree, such as depth-first and breadth-first
iteration, leaves iteration, and bottom-up
iteration.
