The hypercube is a good host graph into which other structures such as arrays, rings and binary trees can be embedded. It has been shown that a complete binary tree of level h+1, Th+1 with 2h+1-1 nodes, can be embedded into an h-dimensional hypercube with dilation 2, congestion 2 and load 3. This paper presents an optimal algorithm that embeds Th into an n-dimensional hypercube (h>n*1) with dilation 2, congestion 2 and load 2h-n.