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

it depends on the order the are added. If you start with the smallest value then the tree will be deeper because all new values will be added to the right child BST. If you add the largest value first then the left child will be deep while the right is empty.