Java Programming

Hi fellow programmers here, i have a question:

let say user input 2 binary tree

Tree1

         1
   2         3
4    5    6   7

Tree2

          8
   9          10
11 12   13   14

how to combine them to make it look like this:

newTree

                  - (empty root)
          1                                8
      2      3                          9       10
   4    5   6   7                     11  12  13  14

where Tree1 and Tree2 is the left and right child of newTree.

Your help is appreciated