Suppose we insert n keys into a regular Binary Search Tree. The first inserted key is 0, the second one is 1 and from then on, each inserted key is the average of the previous two. Thus the sequence of inserted keys begins as follows: 0, 1, 1/2, 3/4, 5/8, . . . The height of the resulting tree is:

1. (1)

2. (log n)

3. (n)

4. (n log n)

5. None of the above