> Input. A sorted list of 32bit unsigned integers vals: Vec<u32>. Okay, but that's not even remotely like the kind of input that this tree was created for. Fro

> Input. A sorted list of 32bit unsigned integers vals: Vec<u32>. Okay, but that's not even remotely like the kind of input that this tree was created for. From the next paragraph, this work is in part > [...] to make efficient datastructures to index DNA [...]. One such datastructure is the suffix array, that sorts the suffixes of the input string. Classically, one can then find the locations where a string occurs by binary searching the suffix array. So where is the analysis of how it performs for that use-case? Searching through "already sorted 32 bit numbers" has nothing to do with searching a 3 billion character string (that by definition cannot be internally sorted) for substrings.