Simple Butterfly Trees in BST Analysis

• Simple Butterfly Trees are binary search trees defined by dyadic recursion using simple butterfly permutations, featuring a self-similar structure and exact height laws.
• They exhibit an exact nonasymptotic height distribution and direct coupling to longest increasing/decreasing subsequences, distinctly differing from classical random BSTs.
• Analytical results extend to precise Horton–Strahler number evaluations and scalable algorithms, offering actionable insights into recursive algebraic generation and tree statistic behaviors.

Searching arXiv for papers on simple butterfly trees and closely related butterfly-tree results. Simple butterfly trees are binary search trees whose insertion order is governed by simple butterfly permutations, namely permutations in the subgroup

$$B_{n,s}:=S_2\otimes S_2\otimes\cdots\otimes S_2=S_2^{\otimes n}\subset S_{2^n}.$$

They form a canonical subclass of butterfly trees and of block BSTs, with a dyadic recursive structure motivated by parallel data architectures and closely related to butterfly permutations arising from Gaussian elimination with partial pivoting on simple butterfly matrices. Their recent study is notable for two exact solvable features: an explicit nonasymptotic law for BST height, and an additive-functional representation for the Horton–Strahler number, both of which sharply distinguish the model from classical random BSTs and from more general wreath-product butterfly constructions (Peca-Medlin et al., 6 Jul 2025, Peca-Medlin, 14 Sep 2025, Peca-Medlin et al., 2024).

1. Definition and recursive realization

For a permutation $\pi$ of $\{1,\dots,n\}$, the BST $T(\pi)$ is obtained by inserting keys in the order prescribed by $\pi$, and the height $h(T(\pi))$ is the maximal depth of any node. In the block BST model, an external BST generated by an external permutation $\rho\in S_m$ has each node replaced by an internal BST generated by an internal permutation $\pi_j\in S_n$; the inter-block edges connect the parent’s top-left or top-right edge endpoint to the child’s root. This construction is encoded algebraically by Kronecker or wreath products of permutation matrices, with Kronecker products as the special case of wreath products with identical internal blocks (Peca-Medlin et al., 6 Jul 2025).

Simple butterfly trees specialize this framework to repeated binary Kronecker products. Writing $N:=2^n$, the simple butterfly permutation group is

$$B_{n,s}=S_2^{\otimes n}\subset S_N,\qquad |B_{n,s}|=2^n=N.$$

A simple butterfly tree with $\pi$0 nodes is $\pi$1 with $\pi$2 uniformly sampled from $\pi$3. Recursively, if $\pi$4 and $\pi$5, then

$\pi$6

At the tree level, $\pi$7 is formed by gluing two copies of $\pi$8 along either the top-right edge if $\pi$9 or the top-left edge if $\{1,\dots,n\}$0. The same recursion can be encoded by a bit string $\{1,\dots,n\}$1: at step $\{1,\dots,n\}$2, one glues a second copy of the level-$\{1,\dots,n\}$3 tree to the end of the current top-right edge if $\{1,\dots,n\}$4, or to the top-left edge if $\{1,\dots,n\}$5. In this formulation, the shape is completely determined by $\{1,\dots,n\}$6 and exhibits a self-similar, rectangular lattice structure (Peca-Medlin, 14 Sep 2025).

This dyadic recursion parallels the stage-by-stage organization of classical butterfly matrices and networks, but the combinatorial object is different. The resulting structure is a BST dictated by binary comparisons during insertion, and the gluing is along extremal paths rather than through a multistage interconnection graph. Algebraically, simple butterfly permutations form an abelian normal subgroup of the nonsimple butterfly group $\{1,\dots,n\}$7, the $\{1,\dots,n\}$8-Sylow subgroup of $\{1,\dots,n\}$9 (Peca-Medlin et al., 6 Jul 2025).

2. Exact height law

The central structural quantities are the extremal edge lengths. If $T(\pi)$0 and $T(\pi)$1 denote the lengths of the top-left and top-right edges of $T(\pi)$2, that is, the number of edges on the unique paths from the root to the nodes $T(\pi)$3 and $T(\pi)$4, then in the simple butterfly model these quantities satisfy a linear recursion together with the height. With $T(\pi)$5 denoting the height and extreme-edge lengths of $T(\pi)$6,

$T(\pi)$7

This implies the identity

$T(\pi)$8

which is special to simple butterfly trees (Peca-Medlin et al., 6 Jul 2025).

The same recursion matches permutation-subsequence statistics. For $T(\pi)$9,

$\pi$0

Under iterated Kronecker products of $\pi$1, $\pi$2 and $\pi$3 either double or remain unchanged at each stage, and they satisfy

$\pi$4

Consequently, if $\pi$5 and $\pi$6, then

$\pi$7

This is an exact nonasymptotic distributional description of the height (Peca-Medlin et al., 6 Jul 2025, Peca-Medlin et al., 2024).

Several immediate consequences follow. The support is

$\pi$8

The minimum is

$\pi$9

while the maximum is $h(T(\pi))$0. Small instances already show the discrete binomial structure: for $h(T(\pi))$1, the possible heights are $h(T(\pi))$2; for $h(T(\pi))$3, they are $h(T(\pi))$4 with multiplicities induced by $h(T(\pi))$5 (Peca-Medlin et al., 6 Jul 2025).

3. Asymptotic growth and comparison with random BSTs

The exact law yields

$h(T(\pi))$6

Thus

$h(T(\pi))$7

with exact leading constant $h(T(\pi))$8. The height therefore grows polynomially in the number of nodes $h(T(\pi))$9, in sharp contrast to the logarithmic height of uniformly random BSTs (Peca-Medlin et al., 6 Jul 2025).

The logarithmic scale of the random exponent is also explicit:

$\rho\in S_m$0

Equivalently,

$\rho\in S_m$1

This is a log-normal-type limit in base $\rho\in S_m$2 driven by the central limit theorem for $\rho\in S_m$3 (Peca-Medlin et al., 6 Jul 2025).

The contrast with classical random BSTs is substantial. Devroye’s theorem states that for $\rho\in S_m$4 and $\rho\in S_m$5,

$\rho\in S_m$6

in probability and in $\rho\in S_m$7 for $\rho\in S_m$8, where $\rho\in S_m$9 is the unique solution to

$\pi_j\in S_n$0

A one-layer block model preserves this logarithmic scaling: if $\pi_j\in S_n$1 or $\pi_j\in S_n$2 with $\pi_j\in S_n$3 fixed, then

$\pi_j\in S_n$4

where $\pi_j\in S_n$5 for $\pi_j\in S_n$6. Simple butterfly trees depart from this regime only after iterating the dyadic Kronecker structure across all levels (Peca-Medlin et al., 6 Jul 2025).

The nonsimple butterfly case is intermediate in tractability but not in growth. For wreath-product butterfly trees,

$\pi_j\in S_n$7

with

$\pi_j\in S_n$8

The larger upper exponent reflects the more flexible wreath-product structure, which introduces max-operations in the height recursion and stronger growth (Peca-Medlin et al., 6 Jul 2025).

From the algorithmic perspective, BST operations scale as $\pi_j\in S_n$9. For simple butterfly trees, typical traversal depth is therefore polynomial rather than logarithmic. This suggests a structural trade-off: the trees inherit deterministic recursive placement and predictable extreme-path gluing, but at the cost of deeper search, insertion, and deletion paths than in classical random BSTs (Peca-Medlin et al., 6 Jul 2025).

4. Horton–Strahler number

The Horton–Strahler number (HS), also called the register function, measures branching complexity. With the convention used in the butterfly-tree analysis, leaves have HS value $N:=2^n$0, and for an internal node $N:=2^n$1 with children $N:=2^n$2 and $N:=2^n$3,

$N:=2^n$4

Equivalently, $N:=2^n$5 is the height of the largest perfect binary subtree embedded in $N:=2^n$6. For any butterfly tree with $N:=2^n$7 nodes,

$N:=2^n$8

and this upper bound is sharp (Peca-Medlin, 14 Sep 2025).

For simple butterfly trees, the HS process can be described directly from the bit string $N:=2^n$9. Define increments

$$B_{n,s}=S_2^{\otimes n}\subset S_N,\qquad |B_{n,s}|=2^n=N.$$0

Then

$$B_{n,s}=S_2^{\otimes n}\subset S_N,\qquad |B_{n,s}|=2^n=N.$$1

In the biased model, where the bits are iid $$B_{n,s}=S_2^{\otimes n}\subset S_N,\qquad |B_{n,s}|=2^n=N.$$2 with $$B_{n,s}=S_2^{\otimes n}\subset S_N,\qquad |B_{n,s}|=2^n=N.$$3, the triplet

$$B_{n,s}=S_2^{\otimes n}\subset S_N,\qquad |B_{n,s}|=2^n=N.$$4

is an $$B_{n,s}=S_2^{\otimes n}\subset S_N,\qquad |B_{n,s}|=2^n=N.$$5-state, irreducible and aperiodic Markov chain, and HS is an additive functional of that chain. In the uniform case $$B_{n,s}=S_2^{\otimes n}\subset S_N,\qquad |B_{n,s}|=2^n=N.$$6, the process reduces to a $$B_{n,s}=S_2^{\otimes n}\subset S_N,\qquad |B_{n,s}|=2^n=N.$$7-state Markov chain for $$B_{n,s}=S_2^{\otimes n}\subset S_N,\qquad |B_{n,s}|=2^n=N.$$8 with transition matrix

$$B_{n,s}=S_2^{\otimes n}\subset S_N,\qquad |B_{n,s}|=2^n=N.$$9

This reduction yields exact means, variances, and fluctuation results (Peca-Medlin, 14 Sep 2025).

For uniform simple butterfly trees,

$\pi$00

more precisely,

$\pi$01

and

$\pi$02

The weak law of large numbers strengthens to an $\pi$03 law of large numbers, and

$\pi$04

with a Berry–Esseen-type bound $\pi$05. The paper identifies this as a genuine Gaussian limit law for HS in a nontrivial random tree model, in contrast with classical models where variance remains bounded and periodic fluctuations obstruct a CLT (Peca-Medlin, 14 Sep 2025).

The biased case remains explicit. If bits are iid $\pi$06, then

$\pi$07

and

$\pi$08

Moreover, the partial-sum process satisfies a Donsker-type invariance principle:

$\pi$09

These results place simple butterfly trees among the rare random-tree models for which HS fluctuations admit a full LLN/CLT/functional CLT package (Peca-Medlin, 14 Sep 2025).

The model also admits an $\pi$10, hence $\pi$11, algorithm for exact HS evaluation from the compressed bit string. If $\pi$12 and the maximal runs of $\pi$13’s in $\pi$14 have lengths $\pi$15, then

$\pi$16

This is exponentially faster than the standard $\pi$17 HS computation on the explicit tree (Peca-Medlin, 14 Sep 2025).

5. Origins in butterfly permutations and broader generalizations

Simple butterfly trees belong to a wider theory of butterfly permutations generated from butterfly matrices by Gaussian elimination with partial pivoting. For binary simple scalar butterfly matrices,

$\pi$18

with $\pi$19 iid uniform on $\pi$20, GEPP produces

$\pi$21

where each $\pi$22 is either the identity or the transposition $\pi$23 depending on whether $\pi$24 or $\pi$25. If the angles are iid uniform, then the induced permutation is uniform on the simple butterfly group. This provides a concrete numerical-linear-algebra origin for the model (Peca-Medlin et al., 2024).

The same paper formulates a $\pi$26-ary generalization. For prime $\pi$27,

$\pi$28

so $\pi$29. The corresponding simple butterfly tree is the rooted $\pi$30-ary tree of depth $\pi$31 in which the action at level $\pi$32 is the same cyclic permutation $\pi$33 applied uniformly across all $\pi$34 subtrees at that level. If

$\pi$35

then the induced action on leaves is

$\pi$36

This rooted-tree action makes explicit that the binary simple butterfly model is the $\pi$37 case of a broader levelwise cyclic construction (Peca-Medlin et al., 2024).

Within this broader setting, the longest increasing subsequence has an exact multiplicative structure:

$\pi$38

Hence

$\pi$39

where

$\pi$40

In the binary case $\pi$41, $\pi$42 exactly, and

$\pi$43

This is precisely the permutation statistic that reappears in the height formula through the identities $\pi$44 and $\pi$45 (Peca-Medlin et al., 2024).

6. Scope, related models, and open problems

The recent literature uses closely related terminology for several distinct objects, and this has generated a potential source of confusion. In the BST literature, simple butterfly trees are the Kronecker-product BSTs associated with $\pi$46. By contrast, “simple staged trees” are staged trees in algebraic statistics for categorical random vectors, defined by the property that stages and positions coincide; the paper that studies them explicitly notes that the term “simple butterfly trees” does not appear there and treats it only as a possible synonym introduced by query ambiguity (Leonelli et al., 2022). Likewise, a later paper on “binary butterfly trees” studies full ordered binary trees produced by gluing two plane binary trees along the rightmost leaf and states that it does not introduce a separate subclass called “simple” (Prodinger, 21 Oct 2025). These are different models, with different size notions, probability distributions, and asymptotic questions.

Within the BST and butterfly-permutation framework, the main limitation of current exact theory is the gap between the simple and nonsimple cases. The simple model relies heavily on the abelian Kronecker-product structure and on the rigid coupling between tree geometry and permutation statistics. In the nonsimple wreath-product case, heterogeneous blocks and max-operators in the height recursion obstruct a clean exact law, and only power-law bounds are known for expected height (Peca-Medlin et al., 6 Jul 2025).

Several open problems are explicitly identified. For nonsimple butterfly trees, one goal is an exact expression or sharper asymptotics for $\pi$47, or a full distributional description analogous to the simple case. For general block BSTs, another problem is to analyze $\pi$48 beyond fixed $\pi$49, especially when both $\pi$50 and $\pi$51 grow. The same work also proposes $\pi$52-ary versions obtained by replacing $\pi$53 by cyclic groups of order $\pi$54, and biased models such as Mallows-type perturbations over butterfly/Kronecker-block permutations (Peca-Medlin et al., 6 Jul 2025).

The Horton–Strahler analysis raises a parallel set of questions. For general butterfly trees, the deterministic upper bound

$\pi$55

remains, and empirical sampling suggests tight concentration near the upper edge of the support; for $\pi$56 and $\pi$57 samples, the recorded counts were HS $\pi$58, HS $\pi$59, and HS $\pi$60, with sample mean $\pi$61 and sample variance $\pi$62. The paper highlights as open directions a dynamic description for top-edge profiles, rigorous concentration and variance bounds, and extensions of the LLN/CLT/functional CLT theory beyond the simple subclass (Peca-Medlin, 14 Sep 2025).

A broader implication is that simple butterfly trees serve as an exactly analyzable interface between recursive algebraic generation, permutation statistics, and random-tree functionals. The exact height law, the coupling to $\pi$63, and the Markov-additive description of Horton–Strahler complexity together make them a reference model for studying how structured insertion orders alter the geometry of binary search trees (Peca-Medlin et al., 6 Jul 2025, Peca-Medlin, 14 Sep 2025, Peca-Medlin et al., 2024).