A hierarchy on a finite set is a partition of the set in which each block is then iteratively sub-partitioned until only singletons remain. We can generate an exchangeable random hierarchy on the natural numbers based on a rooted, weighted real tree (a continuum analogue of a discrete tree) as follows. Let (t_i, i>0) be an i.i.d. sequence of points in the tree, sampled from the weight measure....