* binary tree has O(log) lookups, inserts, and removals * sorted array has O(log) lookups and O inserts and removals * sorted array probably has lower coefficient for lookups, although we don't ...

We show that sparse binary trees represent patterns of gene flow in general pedigrees in a parsimonious manner, and derive a family of related algorithms for pedigree traversal. With these trees ...