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

write a function that reads n random numbers from user input and places them in an empty binary tree. If there is a tie between the new number and an existing number in the tree, place the new number to the left. Then traverse the tree in symmetric order and print each point to the standard output.