We provide a simple demonstration that the n× n× n tree of meshes graph truncated to l levels can be embedded in a three-dimensional (3D) grid using volume O(n 3l 3 2 ) . The maximum wire length in the embedding of the graph is O(nl 1 2 ) . This embedding simplifies the method developed by Leighton and Rosenberg [6] for the 3D embeddings of general graphs and allows the framework of Bhatt and Leighton [1] for 2D graph layout to be extended to 3D. It also leads to good 3D layouts for various fat-tree routing networks [8,2] and the 3D meshes of trees graph [5].