Three Algorithms on Braun Trees

@article{Okasaki1997ThreeAO,
  title={Three Algorithms on Braun Trees},
  author={Chris Okasaki},
  journal={J. Funct. Program.},
  year={1997},
  volume={7},
  pages={661-666}
}
Among the many flavours of balanced binary trees, Braun trees (Braun and Rem, 1983) are perhaps the most circumscribed. For any given node of a Braun tree, the left subtree is either exactly the same size as the right subtree, or one element larger. Braun trees always have minimum height, and the shape of each Braun tree is completely determined by its size. In return for this rigor, algorithms that manipulate Braun trees are often exceptionally simple and elegant, and need not maintain any… CONTINUE READING