Before revision: The main purpose of this work is to prove a theorem about the probability that a random mapping  possesses a unique highest tree in its underlying graph.
After revision: We prove the exact asymptotic 1-\Theta(\frac{1 a random mapping possesses a unique highest tree in its underlying graph.