Module datastructs

source code

Data structures for representing generic trees.

These are for applying generic algorithms to. Note that the trees represented here are ordered trees: their children are ordered. They also contain some methods relating to unordered interpretation, but take care if you want to implement an algorithm on unordered trees that all your operations are unordered.