We study (plane) tree-valued Markov chains $(T_n,n \geq 1)$ with uniform backward dynamics and show that they can be obtained by sampling from a real tree. As non--plane trees, every such Markov chain is represented by a weighted real tree. We equip this real tree with a planar order as well as some extra functions for the full representation theorem. We also show that under an inhomogeneous rescaling after trimming leaves $(T_n, n\geq 1)$ converges to a random real tree in the Gromov--Prokhorov metric. This makes use of a special class of real trees, interval partition trees, which were introduced by Forman (2020). Moreover, this generalises and sheds some new light on work by Evans, Grübel and Wakolbinger (2017) on the binary special case.