Algorithm of combining two binary trees?

Question

For example:

two trees :

       8                   9
   5        7          4       20
                    30

become one tre

Answer 1

Basic answer would be just to add all the elements in the smaller tree into the bigger tree.

Another possiblity would be to look into B-Trees (self balancing trees)