This paper studies the arrangement problem of uniform trees and shows that the arrangement complexity of a uniform tree is
either θ(1) or Ω((lg n)γ)(γ > 0). It also presents a recursive algorithm to compute the optimal complete arrangements for θ(1) arrangeable balanced
uniform trees.