LeetCode 270: Closest Binary Search Tree Value

最新推荐文章于 2021-06-09 10:06:04 发布

原创最新推荐文章于 2021-06-09 10:06:04 发布 · 296 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode 题解专栏收录该内容

288 篇文章

订阅专栏

本文介绍了如何在一个非空的二叉搜索树中找到与给定目标值最接近的值。利用二叉搜索树的特性，通过递归的方式遍历树节点，计算每个节点值与目标值之间的绝对距离，并更新最接近的目标值。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

BST. Left node value < root value < right node value.

/*
  Given a non-empty binary search tree and a target value, find the value in BST
  that is closest to the target.
  Note:
  1: Given target value is a floating point.
  2: You are guranteed to have only one unique value in BST that is closest to the target.
*/

// Because it is BST, we are going to use the BST feature.
int closestValue(TreeNode* root, double target) {
  int minDistance = INT_MAX;
  int tmp = root->val;
  while(root) {
    int distance = abs(root->val - target);
    if(distance < minDistance) {
      minDistance = distance;
      tmp = root->val;
    }
    if(root->val > target) root = root->left;
    else if(root->val < target) root = root->right;
    else return root->val;
  }
  return tmp;
}