Random Generation of Trees is about a field on the crossroads between
computer science, combinatorics and probability theory. Computer
scientists need random generators for performance analysis, simulation,
image synthesis, etc. In this context random generation of trees is of
particular interest. The algorithms presented here are efficient and
easy to code. Some aspects of Horton--Strahler numbers, programs written
in C and pictures are presented in the appendices. The complexity
analysis is done rigorously both in the worst and average cases.
Random Generation of Trees is intended for students in computer
science and applied mathematics as well as researchers interested in
random generation.