首页 > 代码库 > Closest Binary Search
Closest Binary Search
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.
Analyse: get the value of each node. Since we know that the closest node is either the root node, or its child node. Use the property of binary search tree, find the value of the corresponding subtree. Compare the diff between root & target and child & target.
1 /** 2 * Definition for a binary tree node. 3 * struct TreeNode { 4 * int val; 5 * TreeNode *left; 6 * TreeNode *right; 7 * TreeNode(int x) : val(x), left(NULL), right(NULL) {} 8 * }; 9 */10 class Solution {11 public:12 int closestValue(TreeNode* root, double target) {13 TreeNode* child = target < root->val ? root->left : root->right;14 if (!child) return root->val;15 int childValue =http://www.mamicode.com/ closestValue(child, target);16 return abs(root->val - target) < abs(childValue - target) ? root->val : childValue;17 }18 };
Closest Binary Search
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。