A lot of research has been devoted to finding efficient embedding of trees into hypercubes. On the other hand, in this paper, we consider the problem of embedding hypercubes into k-rooted complete binary trees, k-rooted sibling trees, binomial trees and certain classes of caterpillars to minimize the wirelength. © 2011 Elsevier B.V. All rights reserved.