Binary Search of Array
If objects are arranged in a sorted array, we can think of the array as a gedanken tree and use our binary search pattern on it.
We can think of a tree as being described by two array indexes, low and high, as follows: