The problem of embedding graphs into other graphs is much studied in the
graph theory. In fact, much effort has been devoted to determining the
conditions under which a graph G is a subgraph of a graph H, having a
particular structure. An important class to study is the set of graphs which
are embeddable into a hypercube. This importance results from the remarkable
properties of the hypercube and its use in several domains, such as: the
coding theory, transfer of information, multicriteria rule, interconnection
networks ...
In this paper we are interested in defining two new classes of embedding
trees into the hypercube for which the dimension is given.