Child nodes need to have a pointer to their parents.
All nodes must be either full or leaves.
Insertion of new nodes should be done on the right.
A new level must only be created when the current level is full. (by tracking size of tree)
Replaying the tournament after 1 change must be a log N operation.
Child nodes need to have a pointer to their parents. All nodes must be either full or leaves. Insertion of new nodes should be done on the right. A new level must only be created when the current level is full. (by tracking size of tree) Replaying the tournament after 1 change must be a log N operation.