At time of submission the _BiasedBinaryTree<T>_ supports splitting and joining, which are the key operations needed for an efficient implementation of the Algorithm described in **[3]**. A test of these can be compiled using **make biased_test**.
_TreeRepresentative_:_BiasedBinaryTree<DynamicAddon>_ is the type maintaining the binary tree structure described in **[1]** and is supposed to maintain _DynamicAddon_'s invariants. It is currently mostly a skeleton.
_TreeRepresentative_:_BiasedBinaryTree\<DynamicAddon\>_ is the type maintaining the binary tree structure described in **[1]** and is supposed to maintain _DynamicAddon_'s invariants. It is currently mostly a skeleton.
_DynamicAddon_ is the Type providing most of the functionality. Its implementation, too, is incomplete.