Clear Python 3 solution faster than 93%
\nclass Solution:\n    def findMin(self, nums: List[int]) -> int:\n        low = 0\n        high = len(nums) - 1\n        while low <= high:\n            mid = 
```\nclass Solution:\n    def findMin(self, nums: List[int]) -> int:\n        low = 0\n        high = len(nums) - 1\n        while low <= high:\n            mid = low + (high - low) // 2\n            ele = nums[mid]\n            if ele > nums[high]:\n                low = mid + 1\n            elif mid == 0 or nums[mid - 1] > nums[mid]:\n                return nums[mid]\n            else:\n                high = mid - 1\n```
['Binary Tree', 'Python', 'Python3']