Closest Binary Search Tree Value

Given a non-empty binary search tree and a target value, find the value in the BST that's closest to the target.

Note:

• Given target value is a floating point.
• Guaranteed to has only one unique value in the BST, which is closest to the target.

This is a relatively simple topic, in fact, is to use in BST to find a given element of the idea, one approach and find, the code is as follows:

#Definition for a binary tree node.#class TreeNode (object):#def __init__ (self, x):#self.val = x#self.left = None#self.right = Noneclasssolution (object):defClosestvalue (self, root, target):""": Type Root:TreeNode:type target:float:rtype:int"""Closet=root.val cur=Root whilecur:ifABS (Target-cur.val) < ABS (Target-closet): Closet=Cur.valifCur.val >Target:cur=Cur.leftElse: Cur=Cur.rightreturnCloset

Closest Binary Search Tree Value