首页 > 代码库 > 270. Closest Binary Search Tree Value
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.
/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */public class Solution { public int closestValue(TreeNode root, double target) { if(root == null) return 0; int ret = root.val; while(root != null){ if(Math.abs(ret - target) > Math.abs(root.val - target)){ ret = root.val; } root = root.val > target ? root.left : root.right; } return ret; }}
270. Closest Binary Search Tree Value
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。