Smallest Missing Number in a Sorted Array

Given a sorted array of distinct non-negative integers, print the smallest non-negative integer that is not present. The solution must run in O(log n).

1 <= n <= 10^5