Write a program in C++ without using libraries such as queue, vector, list, ect that does the following:

1. It reads n points from standard input. Each point has three integer components, (x,y,z).

2. it reads the points it places them in an initially empty binary tree sorted on the y value. If there is a tie the new point goes to the left of the existing point.

3. 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 the tree, which might have p itself as its Y value, or its Y value might just be close to p.