Steiner tree is a fundamental problem in the automatic interconnect optimization for VLSI design. We present a probabilistic analysis method for constructing rectilinear Steiner trees. The best solution under statistical sense is obtained for any given set of N points. Experiments show that our results are better than those by the previous technique or very close to the optima.