A graph of order is said to be embeddable in a graph of order , if contains a spanning subgraph isomorphic to . It is well known that any non-star tree of order is embeddable in its complement (i.e. in ). In the paper “Packing two copies of a tree into its fourth power” by Hamamache Kheddouci, Jean-Francois Saclé, and Mariusz Wodgniak, Discrete Mathematics 213 (2000), 169-178, it is proved that any non-star tree is embeddable in . They asked whether every non-star tree is embeddable in . In this paper, answering their question negatively, we show that there exist trees such that is not embeddable in .