[LeetCode] Closest Binary Search Tree Value

本文轉載自查看原文 2015-08-27 14:28 2736 LeetCode Solutions

Problem Description:

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.

Well, this problem can be solved easily using recursion: just find the closest value in the left and right subtrees and compare them with root -> val. The code is as follows.

 1 class Solution {
 2 public:
 3     int closestValue(TreeNode* root, double target) {
 4         if (!root) return INT_MAX;
 5         if (!(root -> left) && !(root -> right)) return root -> val;
 6         int left = closestValue(root -> left, target);
 7         int right = closestValue(root -> right, target);
 8         double td = abs(root -> val - target), ld = abs(left - target), rd = abs(right - target);
 9         if (td < ld) return td < rd ? root -> val : right;
10         else return ld < rd ? left : right;
11     }
12 };

Notice that in the above code the properties of BST have not been used. So, what do you think? Well, the above code can be extended to Closest Binary Tree Value if this problem is published in the future :-) Well, Stefan posts several solutions (including a shorter C++ one) in 4 languages here. So, refer to them and get more fun :-)

免責聲明！

本站轉載的文章為個人學習借鑒使用，本站對版權不負任何法律責任。如果侵犯了您的隱私權益，請聯系本站郵箱yoyou2525@163.com刪除。

猜您在找 [LeetCode] Closest Binary Search Tree Value II [LeetCode] 270. Closest Binary Search Tree Value 最近的二分搜索樹的值 272. Closest Binary Search Tree Value II [LeetCode] 272. Closest Binary Search Tree Value II 最近的二分搜索樹的值之二 [LeetCode] Validate Binary Search Tree LeetCode:Recover Binary Search Tree LeetCode: Recover Binary Search Tree 解題報告 LeetCode: Binary Search Tree Iterator 解題報告 LeetCode: Validate Binary Search Tree 解題報告 [LeetCode] Convert Sorted List to Binary Search Tree