Write a program called trees that does the following:

1. It reads n points from standard input. Each point has three integer components, (x,y,z).
2. as it reads the points it places them in an initially empty binary tree, tree1 sorted on the x value. If there is a tie the new point goes to the left of the existing point.
3. It traverses tree 1 in preorder, placing each node in an initially empty binary tree tree2 sorted on the y value. If there is a tie the new point goes to the left of the existing point.
4. It traverses tree2 in postorder and prints each point.
5. It reads one more integer from standard input: the probe p, a Y value. It searches for p in tree printing the last point it encounters as it descends through tree2, which might have p itself as its Y value, or its Y value might just be close to p.