In C++, without using any library routines for trees, vectors, ect:

Write a function that given a binary tree of integers Tree1, traverse Tree1 in preorder and place each node in an initially empty binary tree Tree2. If there is a tie in values with a node, the new node goes to the left of the node it tied with.