We construct random metric spaces by gluing together an infinite sequence of pointed metric spaces that we call blocks. At each step, we glue the next block to the structure constructed so far by randomly choosing a point on the structure and then identifying it with the distinguished point of the block. The random object that we study is the completion of the structure that we obtain after an infinite number of steps. In [7], Curien and Haas study the case of segments, where the sequence of lengths is deterministic and typically behaves like n −α . They proved that for α > 0, the resulting tree is compact and that the Hausdorff dimension of its set of leaves is α −1 . The aim of this paper is to handle a much more general case in which the blocks are i.i.d. copies of the same random metric space, scaled by deterministic factors that we call (λ n ) n≥1 . We work under some conditions on the distribution of the blocks ensuring that their Hausdorff dimension is almost surely d, for some d ≥ 0. We also introduce a sequence (w n ) n≥1 that we call the weights of the blocks. At each step, the probability that the next block is glued onto any of the preceding blocks is proportional to its weight. The main contribution of this paper is the computation of the Hausdorff dimension of the set L of points which appear during the completion procedure when the sequences (λ n ) n≥1 and (w n ) n≥1 typically behave like a power of n, say n −α for the scaling factors and n −β for the weights, with α > 0 and β ∈ R. For a large domain of α and β we have the same behaviour as the one observed in [7], which is that dim H (L) = α −1 . However for β > 1 and α < 1/d, our results reveal an interesting phenomenon: the dimension has a non-trivial dependence in α, β and d, namelyThe computation of the dimension in the latter case involves new tools, which are specific to our model. arXiv:1707.09833v2 [math.PR]