Graph embedding is an important technique used in the study of computational capabilities of processor interconnection networks and task distribution. In this paper, we present an algorithm for embedding the Hypercubes into Banana Trees and Extended Banana Trees and prove its correctness using the Congestion lemma and Partition lemma.