[Python3]Find k closest elements Binary Search
\nclass Solution:\n    def findClosestElements(self, arr: List[int], k: int, x: int) -> List[int]:\n        if x <= arr[0]: return arr[:k]\n        if x >= arr[
```\nclass Solution:\n    def findClosestElements(self, arr: List[int], k: int, x: int) -> List[int]:\n        if x <= arr[0]: return arr[:k]\n        if x >= arr[-1]: return arr[-k:]\n        l,r = 0, len(arr)-k\n        while l <r:\n            m =(l+r)>>1\n            if x-arr[m]> arr[m+k]-x:\n                l = m + 1\n            else:\n                r = m\n        return arr[l:l+k]\n```
['Binary Tree', 'Python', 'Python3']