  This article presents two novel algorithms for generating random increasing
trees. The first algorithm efficiently generates strictly increasing binary
trees using an ad hoc method. The second algorithm improves the recursive
method for weighted strictly increasing unary-binary increasing trees,
optimizing randomness usage.
