The CPU time requirement of all ML-trees is shown in Fig. . Here, we notice that all binary ML-trees result in a comparable computational demand at a given threshold p NO . This observation should be highlighted in particular, as the ML-trees of the first four models have a completely different structure and, depending on the depth of the structure, a significantly higher amount of SPFs (see ESI † Figs. ) We conclude that a binary Ml-tree structure should consequently be preferred over other related structures for this system to achieve a reliable low computational cost, as all results trend toward the converged reference calculation with comparable computational cost.