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:

• root = (low + high) / 2

• left = (low, root - 1)

• right = (root + 1, high)

• empty: high < low

Contents    Page-10    Prev    Next    Page+10    Index