. 2025 Aug 22;87(9):134. doi: 10.1007/s11538-025-01509-y

Table 3.

This table provides an overview of where to find a minimal example of two distinct binary trees that either share or differ in two of the three sequences $B$ , $N$ , and $Δ$ . Note that all figures except for Figure 14 show a unique minimal example

First Sequence	Second Sequence	Figure	$n$
$B (T_{1}) = B (T_{2})$	$N (T_{1}) = N (T_{2})$	11	9
$B (T_{1}) \neq B (T_{2})$	$N (T_{1}) = N (T_{2})$	13	11
$B (T_{1}) = B (T_{2})$	$N (T_{1}) \neq N (T_{2})$	14	13
$B (T_{1}) = B (T_{2})$	$Δ (T_{1}) = Δ (T_{2})$	12	11
$B (T_{1}) \neq B (T_{2})$	$Δ (T_{1}) = Δ (T_{2})$	10	6
$B (T_{1}) = B (T_{2})$	$Δ (T_{1}) \neq Δ (T_{2})$	11	9
$N (T_{1}) = N (T_{2})$	$Δ (T_{1}) = Δ (T_{2})$	12	11
$N (T_{1}) \neq N (T_{2})$	$Δ (T_{1}) = Δ (T_{2})$	10	6
$N (T_{1}) = N (T_{2})$	$Δ (T_{1}) \neq Δ (T_{2})$	11	9