C++ || Fast and Easy approach || Binary search
class Solution {\npublic:\n    We will start from top right corner of the matrix.\n    If target is greater then index element then we shift index to bottom.\n 
class Solution {\npublic:\n    **We will start from top right corner of the matrix.\n    If target is greater then index element then we shift index to bottom.\n    But If target is smaller then index element we shift index to left.\n    If target is not present in matrix then we will go bound.**\n    \n        bool searchMatrix(vector<vector<int>>& matrix, int target) {\n        int row=matrix.size();\n        int col=matrix[0].size();\n        int i=0,j=col-1;\n        while(matrix[i][j]!=target){\n            if(i<0 or j<0 or i>row-1 or j>col-1) //if out of bond then return false\n                return false;\n            if(matrix[i][j]<target){\n                i=i+1;\n                if(i>row-1)\n                    return false;\n            }\n            else{\n                j=j-1;\n                if(j<0)\n                    return false;\n            }\n        }\n        return true;\n    }\n\t**Upvote if you find useful**\n};
['Binary Tree']