Abstract

AbstractA random suffix search tree is a binary search tree constructed for the suffixes Xi = 0 · BiBi+1Bi+2… of a sequence B1, B2, B3, … of independent identically distributed random b‐ary digits Bj. Let Dn denote the depth of the node for Xn in this tree when B1 is uniform on ℤb. We show that for any value of b > 1, 𝔼Dn = 2 log n + O(log2log n), just as for the random binary search tree. We also show that Dn/𝔼Dn → 1 in probability. © 2003 Wiley Periodicals, Inc. Random Struct. Alg., 2003

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call