Figure 2From: Fast calculation of the quartet distance between trees of arbitrary degreesA worst case input tree for the algorithm. A tree with an internal node of degree , connected to internal nodes of degree three each connected to two leaves. This tree has both a maximal degree of O(n) and at the same time O(n) inner nodes.Back to article page