Given a BST and an integer. Find the least absolute difference between any node value of the BST and the given integer.
Input: 10 / \ 2 11 / \ 1 5 / \ 3 6 \ 4 K = 13 Output: 2 Explanation: K=13. The node that has value nearest to K is 11. so the answer is 2
Input: 8 / \ 1 9 \ \ 4 10 / 3 K = 9 Output: 0 Explanation: K=9. The node that has value nearest to K is 9. so the answer is 0.
You don't need to read input or print anything. Your task is to complete the function minDiff() that takes the root of the BST and an integer K as its input and returns the minimum absolute difference between any node value of the BST and the integer K.
Expected Time Complexity: O(Height of the BST).
Expected Auxiliary Space: O(Height of the BST).
1 <= Number of nodes <= 100000
We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?Yes