Let G be a graph with n vertices and n edges. The problem of constructing a spanning tree is to find a connected subgraph of G with n vertices and n -1 edges. In this paper, we propose an O(log n) time parallel algorithm with O(n/ log n) processors on an EREW PRAM for constructing a spanning tree on trapezoid graphs.