I will speak about results from an ongoing project with Louigi Addario-Berry. I will present non-asymptotic, universal height bounds for random combinatorial trees. We use these results to show height bounds on conditioned Bienaymé trees and simply generated trees. Moreover, I will introduce a stochastic domination result for combinatorial trees, implying that binary trees are stochastically the tallest. These results are based on a new bijection between trees and sequences that got introduced in a joint work with Louigi Addario-Berry, Mickaël Maazoun and James Martin.