in python or java

In this task we will consider a binary search tree T. One algorithm considered in class takes as input T and a number and checks whether T has a node whose content is . In this section, we consider a task of finding a node of T whose content y is closest to 2. The closest' means that abs( -y) is smallest possible among all the nodes of T (abs is the absolute value of a number). For example, if the numbers stored in the nodes of T are 1.2.5, 8 and = 3 then the closes value tor is 2. Write a program whose input is a binary search tree T and an integer number 2. The program should print the content y of a node of T that is closest to r. The runtime of the program must be o(d) where d is the depth of the tree