Given a non-empty binary search tree and a target value, find the value in the BST that is closest to the target.
Solution 1
public class Solution {
public int closestValue(TreeNode root, double target) {
int closest = root.val;
double min = Double.MAX_VALUE;
while(root!=null) {
if( Math.abs(root.val - target) < min ) {
min = Math.abs(root.val - target);
closest = root.val;
}
if(target < root.val) {
root = root.left;
} else if(target > root.val) {
root = root.right;
} else {
return root.val;
}
}
return closest;
}
}