This type represents a binary tree, where each branch is guaranteed to have two children (i.
IndexedBitSet is an immutable set for storing non-negative integer values.
This class is used to construct an IndexedBitSet.
A succinct data structure for representing k-ary trees with arbitrary data attached to each node.
TreeOps is a type class for abstracting over arbitrary trees, allowing traversal and data access.