Skip to main content
. 2022 Apr 12;71(5):1210–1224. doi: 10.1093/sysbio/syac027

Figure 3.


Figure 3.

a) A tree in which each internal node has null size and splits its descendants into subtrees of equal magnitude, and hence Inline graphic. This tree can be considered balanced only according to an index that accounts for node size. b) A linear tree, for which Inline graphic. c–e) A robust, universal tree balance index Inline graphic is insensitive to the addition of a subtree of arbitrarily small magnitude if it is added to a leaf (a) or a nonroot node with out-degree 1 (b), but not necessarily if the subtree is added to a nonroot node with greater out-degree (c).