you answer this question before but I have a question :Initialization minimum difference should be inside or outside def find_closest?

in python or java it is answered before but it is not clear

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 2. In this section, we consider a task of finding a node of T whose content is closest tor. The closest' means that absor-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 r = 3 then the closes value to x is 2 Write a program whose input is a binary search tree T and an integer number . 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