Average height of a binary search tree

Question

How do you compute the average height of a binary search tree when adding 1000 random ints? What is the average height?

Answer 1

Regardless of what tree you are using the average height will be log2(1000), as someone mentioned before. It's true that depending on the order of the numbers inserted the actual height may vary, but assuming randomly distributed numbers, which you mention, then the actual value will, more often than not, approximate the expected value (Which, once again, is log2(1000))