We extend the cactus theorem of Dinitz, Karzanov, Lomonosov to metric spaces. In
particular we show that if X is a separable continuum which is not separated by
n− 1 points then the set of all n–tuples of points separating X can be encoded by an
R–tree.