According to Cayley's tree formula, there are $n^{(n-2)}$ labeled trees on $n$ vertices. Prufer gave a sequential mapping algorithm between a labeled tree and a number sequence. We shall propose an $O(/log n)$ time parallel algorithm for constructing a labeled tree by using $O(n)$ processors and $O(n \log n)$ space on the EREW PRAM computational model.