The average depth of a binary searchtree is

A

$$ O(n^{0.5})$$

B

$$ O(n)$$

C

$$ O(\log n)$$

D

$$ O(n \log n)$$