Algorithm to join k binary trees to get a single binary tree of minimum height

Question

Suppose you are given a collection of binary trees, T1, T2, . . . , Tk. Your task is to join all the trees to form one single binary tree that has the minimum possible heigh