Update datastructures/trees/binary/search_tree/binary_search_tree.py

Co-authored-by: coderabbitai[bot] <136622811+coderabbitai[bot]@users.noreply.github.com>

Author: BrianLusina

datastructures/trees/binary/search_tree/binary_search_tree.py

@@ -347,7 +347,7 @@ def find_closest_value_in_bst(self, target: T) -> Optional[BinaryTreeNode]:
 
         # while the queue is not empty, we pop off nodes from the queue and check for their values
         while current:
-            current_diff = abs(target - self.root.data)
+            current_diff = abs(target - current.data)
 
             if current_diff < min_diff:
                 min_diff = current_diff