[C++]  Binary Search || Best Optimized Approach
*upvote if it you find helpfull -> thanks*\n\n\t\tint rowstart = 0;\n        int rowend = matrix.size();\n        int colend = matrix[0].size()-1;\n        whil
****upvote if it you find helpfull -> thanks****\n\n\t\tint rowstart = 0;\n        int rowend = matrix.size();\n        int colend = matrix[0].size()-1;\n        while(rowstart<rowend && colend>=0)\n        {\n            int element = matrix[rowstart][colend];\n            if(element == target) return true;\n            else if(target < element){\n                colend--;\n            }\n            else if(target > element)rowstart++;\n        }\n        return false;
['Array', 'C', 'Binary Tree']