Easiest and best C++ solution : beats 100% submissions
\n int findMin(vector<int>& nums) {\n        int s = 0;\n        int e = nums.size()-1;\n        int mid;\n        \n        while(s<=e){\n            mid = (s+
```\n int findMin(vector<int>& nums) {\n        int s = 0;\n        int e = nums.size()-1;\n        int mid;\n        \n        while(s<=e){\n            mid = (s+e)/2;\n            \n            if(nums[mid] >= nums[e]){\n                s = mid+1;\n            }\n            else{\n                e = mid;\n            }\n        }\n        return nums[mid];\n        \n    }\n```\t
['C', 'Binary Tree', 'C++']