Learn More
We study binary search trees constructed from Weyl sequences fnng; n 1, where is an irrational and f:g denotes \mod 1". We explore various properties of the structure of these trees, and relate them to the continued fraction expansion of. If H n is the height of the tree with n nodes when is chosen at random and uniformly on 0; 1], then we show that in(More)
  • 1