Credit to Danny Sleator for this approach.

Implement this algorithm to determine which nodes to compact (potentially creating new labels).

Note: this approach does not take into account recursive compaction. For example, running node compaction on a binary tree would create new labels and also eliminate them due to the intermediate nodes all being 1:2 nodes.