Validate Binary Search Tree
Question
- leetcode: Validate Binary Search Tree
- lintcode: Validate Binary Search Tree
Write an efficient algorithm that searches for a value in an m x n matrix.
This matrix has the following properties:
- Integers in each row are sorted from left to right.
- The first integer of each row is greater than the last integer of the previous row.