270. Closest Binary Search Tree Value

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

Note:

• Given target value is a floating point.
• You are guaranteed to have only one unique value in the BST that is closest to the target.

方法：递归查找。如果当前节点值小于目标值，则结果只可能是当前节点值或者右子树中的值；如果当前节点值大于目标值，则结果只可能是当前节点值或者左子树中的值。

public class Solution {  
    private int value;  
    private void find(TreeNode root, double target) {  
        if (Math.abs(root.val-target) < Math.abs(value-target)) value = root.val;  
        if (root.val < target && root.right != null) find(root.right, target);  
        if (root.val > target && root.left != null) find(root.left, target);  
    }  
    public int closestValue(TreeNode root, double target) {  
        value = root.val;  
        find(root, target);  
        return value;  
    }  
}